journal-of-information-and-optimization-sciences Journal of Information and Optimization Sciences 2169-0103 0252-2667 Taru Publications 10.47974/JIOS-1285 Dominator coloring of Kneser graph Zhao Conghui School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, 810008, China Zhang Shumin School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, 810008, China Academy of Plateau Science and Sustainability, People’s Government of Qinghai Province and Beijing Normal University, Qinghai Normal University, Xining, Qinghai, 810008, China Jia Tianxia School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, 810008, China Ye  Chengfu School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, 810008, China Academy of Plateau Science and Sustainability, People’s Government of Qinghai Province and Beijing Normal University, Qinghai Normal University, Xining, Qinghai, 810008, China 45 1 107 120 05 02 2024

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 χ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.  

 Dominator coloring Steiner triple systems Kneser graph access open retracted no