Dominator coloring of Kneser graph

被引:0
作者
Zhao, Conghui [1 ]
Zhang, Shumin [1 ,2 ,3 ,4 ]
Jia, Tianxia [1 ]
Ye, Chengfu [1 ,2 ,3 ,4 ]
机构
[1] Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Qinghai, Peoples R China
[2] Acad Plateau Sci & Sustainabil Peoples Govt Qingh, Xining 810008, Qinghai, Peoples R China
[3] Beijing Normal Univ, Xining 810008, Qinghai, Peoples R China
[4] Qinghai Normal Univ, Xining 810008, Qinghai, Peoples R China
关键词
Dominator coloring; Steiner triple systems; Kneser graph; CHROMATIC NUMBER;
D O I
10.47974/JIOS-1285
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
A dominator coloring (briefly DC) of a graph G is a proper coloring such that each vertex dominates every vertex of at least one color class (possibly its own class). The dominator chromatic number chi(d)(G) of G is the smallest cardinality of color classes in a DC of G. . By using Steiner triple systems, in this paper, we establish that the dominator coloring of the Kneser graph KG(n, 2) is n for n >= 5.
引用
收藏
页码:107 / 120
页数:14
相关论文
共 23 条
[1]  
Abid AM, 2019, AUSTRALAS J COMB, V73, P274
[2]  
Arumugam S, 2011, LECT NOTES COMPUT SC, V7056, P19, DOI 10.1007/978-3-642-25011-8_2
[3]   On the locating chromatic number of Kneser graphs [J].
Behtoei, Ali ;
Omoomi, Behnaz .
DISCRETE APPLIED MATHEMATICS, 2011, 159 (18) :2214-2221
[4]   Dominator Colorings in Some Classes of Graphs [J].
Chellali, Mustapha ;
Maffray, Frederic .
GRAPHS AND COMBINATORICS, 2012, 28 (01) :97-107
[5]  
Gera R., 2006, Congr. Numer, V181, P19
[6]  
Harrary F., 1969, Graph Theory, DOI [10.1201/9780429493768, DOI 10.1201/9780429493768]
[7]   Total Dominator Colorings and Total Domination in Graphs [J].
Henning, Michael A. .
GRAPHS AND COMBINATORICS, 2015, 31 (04) :953-974
[8]  
Ivanco J., 1993, MATH BOHEM, V118, P147
[9]  
Jalilolghadr P, 2020, Arxiv, DOI arXiv:2001.00221
[10]  
Kavitha K., 2012, International Journal of Mathematical Archive, V11, P3954