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

Abstract

Let n be the set of integer modulo n. The Cayley graph on n is an undirected graph whose vertex set is n and two vertices a, b are adjacent if and only if \{0}. n a − b∈S ⊆  The addition Cayley graph on n is a graph whose vertex set is n and two vertices a, b are adjacent if and only if . n a + b∈A ⊆  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.