Abstract
Decomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e. a partition of the vertex set V(G) into independent subsets named color classes) in which each vertex of the graph is adjacent to all of vertices of some color class. The total dominator chromatic number of G is the minimum number of color classes in a TDC of G. In this paper among some other results and by using the existence of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph for each
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.