The total dominator chromatic number in paths is determined in this research. Assume that there are no isolated vertices in the graph. A valid colouring of a graph G with the extra characteristic that each vertex in the graph G dominates a colour class properly is known as total dominator colouring. The total dominator chromatic number of G is the smallest number of colours for which a total dominator colouring of G exists, and it is represented by. This study determines the overall dominator chromatic number in paths. Unless otherwise indicated, n signifies an integer larger than or equal to 2.
Author (S) Details
A. Vijayalekshmi
S.T.Hindu College, Nagercoil, Tamil Nadu, India.
View Book :- https://stm.bookpi.org/CTMCS-V9/article/view/3638
No comments:
Post a Comment