Back to Search
Start Over
Total dominator chromatic number of specific graphs
- Publication Year :
- 2015
-
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.<br />Comment: 10 pages, 8 figures
- Subjects :
- Mathematics - Combinatorics
05C15, 05C69
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1511.01652
- Document Type :
- Working Paper