شماره ركورد كنفرانس :
3753
عنوان مقاله :
Total dominator chromatic number in graphs
عنوان به زبان ديگر :
Total dominator chromatic number in graphs
پديدآورندگان :
Mojdeh D.A. University of Mazandaran , Nazari E. University of Tafresh , Askari S. University of Tafresh
كليدواژه :
Graph , Total Domination , Coloring , Total dominator coloring.
عنوان كنفرانس :
دومين كنفرانس ملي تركيبيات رمزنگاري و محاسبات
چكيده فارسي :
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.
چكيده لاتين :
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.
