Total dominator chromatic number of specific graphs

2015/11/05 by Alikhani, Saeid, Ghanbari, Nima
#05C15 #05C69 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1511.01652

Abstract

Let G be a simple graph. A total dominator coloring of G is a proper coloring of the vertices of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number χ_d^t(G) of G is the minimum number of colors among all total dominator coloring of G. In this paper, we study the total dominator chromatic number of some specific graphs.

Related

• Total dominator chromatic number of some operations on a graph
• Total dominator coloring number of middle graphs
• Total dominator total chromatic numbers of cycles and paths
• Total dominator chromatic number of k-subdivision of graphs
• More on the total dominator chromatic number of a graph