Abstract
In this paper we determine total dominator chromatic number in paths. Let be a graph without isolated vertices. A total dominator coloring of a graph G is a valid colouring of the graph G with the additional feature that each vertex in the graph G dominates a color class properly. The total dominator chromatic number of G is the fewest number of colors for which there is a total dominator coloring of G, and it is indicated by . The total dominator chromatic number in paths is determined in this research. n denotes an integer greater than or equal to 2 unless otherwise specified.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
