abstract 42

Bulletin of Computational Applied Mathematics (Bull CompAMa)

42

Total dominator chromatic number of some operations on a graph

Nima Ghanbari, Saeid Alikhani


Let <i>G</i> be a simple graph. A total dominator coloring of <i>G</i> is a proper coloring of the vertices of <i>G</i> in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number &#935;<sup>t</sup><sub>d</sub>(<i>G</i>) of <i>G</i> is the minimum number of colors among all total dominator coloring of <i>G</i>. In this paper, we examine the effects on &#935;t</sup><sub>d</sub>(<i>G</i>) when <i>G</i> is modified by operations on vertex and edge of <i>G</i>.


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.