|
Title
|
Total dominator chromatic number in graphs
|
|
Type
|
Presentation
|
|
Keywords
|
Graph, Total Domination, Coloring,Total dominator coloring
|
|
Abstract
|
A given graph G has a total dominator coloring if it has a proper coloring in which each vertex of G is adjacent to every vertex (or all vertices) of some color class. The total dominator chromatic number ) (G t d of G is the minimum number of color classes in a total dominator coloring of a graph G . In this paper we study the total dominator chromatic number on several classes of graphs.
|
|
Researchers
|
Saeid Askari (Third Researcher), Esmail Nazari (Second Researcher), Doost Ali Mojdeh (First Researcher)
|