A characterization of some types of Cayley graphs and addition Cayley graphs and their total chromatic numbers

被引:0
作者
Momrit, Puttipong [1 ]
Promsakon, Chanon [1 ]
机构
[1] King Mongkuts Univ Technol North Bangkok, Dept Math, Fac Sci Appl, Bangkok 10800, Thailand
关键词
Cayley graph; Addition Cayley graph; Total coloring; Total chromatic number;
D O I
10.47974/JDMSC-1621
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let Z(n) be the set of integer modulo n. The Cayley graph on Z(n) is an undirected graph whose vertex set is. n and two vertices a, b are adjacent if and only if a - b is an element of S subset of Z(n) \{0}. The addition Cayley graph on Z(n) is a graph whose vertex set is Z(n) and two vertices a, b are adjacent if and only if. a + b is an element of A subset of Z(n) . In this paper, we characterize Cayley graphs and addition Cayley graphs of even orders. Their basic properties of them are investigated. We also give exact values for the total chromatic numbers of Cayley graphs and addition Cayley graphs where their orders are even integers. Moreover, we provide examples to illustrate these results.
引用
收藏
页码:963 / 981
页数:19
相关论文
共 25 条
[1]  
BEHZAD M, 1967, J LONDON MATH SOC, V42, P228
[2]  
Behzad M., 1965, Graphs and Their Chromatic Numbers
[3]  
Biggs N., 1993, Algebraic graph theory
[4]  
Bondy J. A., 1976, Graph theory with applications
[5]  
BORODIN OV, 1989, J REINE ANGEW MATH, V394, P180
[6]   On colouring the nodes of a network [J].
Brooks, RL .
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197
[7]   TOTAL CHROMATIC NUMBER OF COMPLETE R-PARTITE GRAPHS [J].
CHEW, KH ;
YAP, HP .
JOURNAL OF GRAPH THEORY, 1992, 16 (06) :629-634
[8]  
Cheyne B., 2003, Math J., V4, P6
[9]   More on the total dominator chromatic number of a graph [J].
Ghanbari, Nima ;
Alikhani, Saeid .
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2019, 40 (01) :157-169
[10]  
Godsil C., 2001, Graduate Texts in Mathematics, V207