abstract 42


42
Total dominator chromatic number of some operations on a graph
Nima Ghanbari, Saeid Alikhani

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 Χtd(G) of G is the minimum number of colors among all total dominator coloring of G. In this paper, we examine the effects on Χtd(G) when G is modified by operations on vertex and edge of G.

Keywords: Total dominator chromatic number, contraction, graph

Cite this paper:
Ghanbari N., Alikhani S., Total dominator chromatic number of some operations on a graph
Bull. Comput. Appl. Math. (Bull CompAMa),
Vol. 6, No. 2, Jul-Dec, pp.9-20, 2018