Total dominator chromatic number of specific graphs

Saeid Alikhani; Nima Ghanbari

Total dominator chromatic number of specific graphs

Combinatorics 2015-11-06 v1

Authors: Saeid Alikhani , Nima Ghanbari

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 $\chi_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.

Keywords

total dominator coloring total dominator chromatic number graph coloring specific graphs vertex coloring proper coloring graph theory

Cite

@article{arxiv.1511.01652,
  title  = {Total dominator chromatic number of specific graphs},
  author = {Saeid Alikhani and Nima Ghanbari},
  journal= {arXiv preprint arXiv:1511.01652},
  year   = {2015}
}

Comments

10 pages, 8 figures

Related papers

View all related →