1 Introduction
Total coloring of a simple graph is a coloring of the vertices and the edges such that any adjacent vertices or edges or edges and their incident vertices do not receive the same color. The total chromatic number of a graph G, denoted by , is the minimum number of colors that suffice in a total coloring. It is clear that , where is the maximum degree of G.
The Total coloring conjecture (TCC) (Behzad [3] and Vizing [8] independently proposed) is a famous open problem in graph theory that states that any simple graph with maximum degree can be totally colored with at most colors. The progress on this conjecture had been low in the initial years but several advancements are in progress[4]. The graphs that can be totally colored in colors are said to be type I graphs and the graph with the total chromatic number is said to be type II. The other notations used are standard in graph most graph theory literature.
A Cayley graph for a group with symmetric generating set is a simple graph with vertices as all the elements of the group; and edges between each two elements of the form and , where . Note that a symmetric subset implies .The set is also supposed to not have the identity element of the group. The Circulant graph is a Cayley graph on the group , the cyclic group on vertices. The Unitary Cayley graph is defined as the Cayley graph of the group with generating set . Thus, the degree of is . Thus, it is also a Circulant graph.
2 Total chromatic number of some classes of Cayley graphs
It has been proved by J Geetha et al.[4] that the Unitary Cayley graphs satisfy the Total Coloring conjecture, that is, their total chromatic number is at most , where be the degree of the graph. The Unitary Cayley graphs for
even is seen to have a better structure. In fact, it is bipartite with the two parts consisting of odd and even numbers less than
respectively. In this case it is proved here that almost all such graphs have total chromatic number , where is the degree of the graph.Theorem 2.1.
If , where is a positive integer, then the total chromatic number of the graph ,
Proof.
It is easily seen that . Thus, the graph in this case is a complete regular bipartite graph, whence its total chromatic number is . ∎
Theorem 2.2.
If or , where are positive integers, is an odd prime and is odd, then the graph is total colorable with colors.
Proof.
Case 1:
Let the least prime that divides be . Now, the number of vertices can be divided into independent sets or color classes with number of vertices in each set. The sets can be written as . This is seen to be a conformable vertex coloring as the parity of each independent set is even.
Now, consider the total color matrix of the graph. We split the total color matrix into two parts the first part concerns the total coloring of the subgraph which consists of the vertices and hamiltonian cycles. This corresponds to labelling of the diagonal entries and superdiagonals (subdiagonals) of the total color matrix. Since and generate the same cycle in the graph, the entry started at the th superdiagonal continues to the th superdiagonal, where is any element of the generating set of . This forces that the differences between the entries of the th and th superdiagonal should be .
Let us consider the pairs of numbers and . Note that whenever the number is 0, it is considered as .
The conditions put on ensure that the numbers inside the brackets are all distinct and all the differences between the number pairs from to are covered, thereby ensuring that all the numbers from to are covered [1].
Using this rule, the entries (the first entries and the last entries) of the first row is chosen by the following rule: (here is the column number of the color matrix,
i) If then the entry in that column is .
ii) If is odd, then the entry at the th column is . Note that this would force the entry at the th column to be .
iii) If is even, then the entry at the th column is . Note that this would force the entry at the th column to be .
It is seen that the entries generated by the above rules give us distinct entries by the prior discussion. The first column along with the even numbers less than , (corresponding to the odd numbers in less than in the generating set of ) are the required column numbers which are the starting entries of the superdiagonals. We start the diagonal in the pattern . The entries of the superdiagonals start from the first entries determined by the above rules and then follow a similar pattern as in the principal diagonal. Let be the entry at the column. The entries of the superdiagonals (corresponding to the colors of the edges) clash with the vertex colors only when or . Now, using the above rules, these amount to either and , when is odd; or and . Solving these congruences using the fact that , we obtain the only case , which implies , which cannot happen, because . Hence, the colors assigned to the vertices and its incident edges do not clash. In addition, the colors assigned to the edges do not clash because the initial column numbers are all less than . By symmetry, the subdiagonals are also filled. This fills diagonal elements with the colors corresponding to a conformable vertex coloring. Also, the entries corresponding to hamiltonian cycles. The colors used up to now is .
Now, consider the remaining part of the total color matrix. It consists of edge coloring of remaining hamiltonian cycles, which are all even, as the graph is bipartite. Since the bipartite graphs are class I, the remaining edges are colored with extra colors. Thus, total number of colors used is colors.
Case 2:
When , the resulting unitary Cayley graph is a balanced complete multipartite graph with parts. Hence, by Bermond’s theorem [2], it is evidently type I. ∎
Example 2.1.
The adjacency matrix of the graph is shown in the table 1.
The first part of the total color matrix is as given in the table 2.
Here, the empty cells in the adjacency matrix do not receive any color in the total color matrix. Here, the least odd prime dividing is , whence we give a  vertex conformable coloring to the vertices. In the first row, first entry is and the second entry is given by . This immediately gives us the entry of column to be . The next row is just the first row shifted to the left, with the entry corresponding to the nonzero entries of the adjacency matrix. The cyclic pattern of the first row is . Correspondingly the cyclic pattern is adopted in the subsequent rows with first entries determined by the symmetry of the total color matrix. This gives us a total coloring of the subgraph consisting of all the vertices and one Hamiltonian cycle.
The second part of the total color matrix is as given in the table 3.
Here, we have used extra colors to the remaining edges. The final total color matrix is shown in the table 4.
A regular graph is said to have a divisible vertex coloring if its vertices can be given at most colors such that each color class of vertices have the same cardinality and as well as have the same parity as the number of vertices. Note that for a circulant graph on vertices with generating set , and not dividing any implies that there exists a divisible vertex coloring of with
colors, as we can classify the vertices (vertices are labled as
) as .Theorem 2.3.
Consider an odd circulant graph with generating set such that is not divisible by , and any two are not congruent modulo . Then is of type I.
Proof.
We fill the total color matrix by following a procedure similar to the one used in Theorem . The entries of the first row of the total color matrix is chosen by the following rule: (here is the column number of the color matrix with )
i) If then the entry in that column is .
ii) If is odd, then the entry at the th column is . Note that this would force the entry at the th column will be .
iii) If is even, then the entry at the th column is . Note that this would force the entry at the th column will be .
It is seen that the entries generated by the above rules give us distinct entries and each row and/or column has only one instance of each nonzero element. This is because the additional criterion that for any two generating elements of the graph and , we have , thereby ensuring the distinctness of the starting points of each superdiagonal. Let be the entry at the th position. Then the colors so put on the edges (superdiagonals) clash with the vertex colors only when or respectively. Now, using the above rules, these amount to either and , when is odd; or and . Solving these congruences using the fact that , we obtain the only case , which implies . However, we note that since corresponds to a generating element of the graph, and it is additionally given that no generating element of the graph is divisible by the situation is not possible.
We then start the diagonal in the pattern . The entries of the superdiagonals start from the entries determined by the above rules and then follow a similar pattern as in the principal diagonal. By symmetry the subdiagonals are also filled. This fills the diagonal elements with the colors corresponding to the above divisible vertex coloring and a edge coloring, which satisfy the total coloring condition. This gives us a or a type I total coloring of the graph. ∎
Example 2.2.
Take the Cayley graph on the group corresponding to the generating set . Here, , and it satisfies all the conditions of the previous theorem with the divisible vertex color classes given by (0,7,14), (1,8,15), (2,9,16), (3,10,17), (4,11,18), (5,12,19), (6,13,20), where the vertices are the integers from to inclusive.
Theorem 2.4.
If is a circulant graph on vertices with and such that is connected. Then is type I.
Proof.
Since is circulant, therefore is also circulant. As is connected, therefore has a perfect matching as is even, by [5]. Let . Thus, the pairs of vertices are independent in , and we give a colors to these independent sets of vertices, which is a divisible vertex coloring. This vertex coloring can be extended to a partial total coloring of , say the total coloring of a sub graph , where is so chosen that is connected (which can always be done as the graph has degree ).
This total coloring of (the partial total coloring of ) can be done by a procedure similar to that in the previous Theorem 2.3. For that the entries corresponding to the first row of are chosen by the following rules (here is the column number of the total color matrix, ):
i) If then the entry in that column is .
ii) If is odd, then the entry at the th column is .
Note that this would force the entry at the th superdiagonal to be .
iii) If is even, then the entry at the th column is .
Note that this would force the entry at the th column to be .
In this case, as in the previous theorem, the distinctness of the starting entries of the subdiagonals are ensured as and no two column numbers are congruent modulo .
By using the above entries as a starting entry, we could fill the chosen superdiagonals as in the previous theorem. The entries of the superdiagonals (corresponding to the colors of the edges) clash with the vertex colors only when or respectively. Now, using the above rules, these amount to either and , when is odd; or and . Solving these congruences using the fact that , we obtain the only case , which implies . However, we note that since and ranges from to , such a condition does not occur. Hence, the nonclashing of the edge colors with the vertex colors is thereby satisfied.
The remaining nonzero super (sub) diagonals can be easily filled with colors, as it corresponds to an edge coloring of the graph , which is of class I by [6]. Thus, we used , to color . Hence is type I. ∎
Since we can fill the entries of the color matrix of the graphs in the above four theorems in a linear number of steps compared to the input, the algorithm used to give the total coloring is polynomial time in all the above cases.
Theorem 2.5.
If be a noncomplete Cayley graph of odd order and clique number . Then, is not of type I.
Proof.
It is easy to see that a Cayley graph with clique size will not have an isolated maximal clique if it is not complete. On the other hand, the graph would have exactly number of maximal cliques. This is seen as follows: Let be the elements of the group underlying and the elements of the generating set of . Suppose be the sequence of vertices of a clique. Then, are also the vertices of a clique for any . Since this sequence of vertices can be written for any element and there are elements in the group, hence we have different maximal cliques. Note that the cliques can intersect and may share some edges as one or more vertices in the sequences can be the same.
Now, for a type I total coloring, the graph should have a conformable coloring, which implies, by the regularity of , that each color class should have the same parity as that of , which is odd. Since the clique size , we cannot put more than two vertices in any color class (for otherwise, there might be two adjacent vertices in the same color class). The only way the graph can have a conformable coloring is that each color class have exactly one vertex, but such a coloring would exceed colors as the graph is not complete. Thus, the graph does not have a conformable coloring, whence the graph is not type I. ∎
Theorem 2.6.
Let be is a perfect Cayley graph with and being odd. Then satisfies TCC.
Proof.
Since is perfect, therefore the clique number is also equal to the chromatic number, which is , an odd integer. Now, the case when the graph is complete is trivial. When the graph is not complete, as in the previous theorem, the graph will not have an isolated clique, rather has disjoint maximal cliques. The reason for this is as follows: Since we have vertices and the clique number is , we have different cliques (of course several intersecting). Hence, any maximal independent set would contain at most vertices in it. By [7], we have that every maximal clique intersects every maximal independent set. Therefore each disjoint maximal independent set of vertices has one vertex of each of a maximal clique. Thus, there are vertex disjoint maximal cliques. In fact, the vertices would be distributed equitably in independent sets in a coloring.
Now, we proceed to coloring. We first color the vertices of with colors. Using the same colors, we can color the edges of the disjoint cliques such that each of the disjoint cliques are colored totally. Now, let the union of cliques be the graph . Consider the graph . We observe that is a regular graph, hence requires at most extra colors to color the edges. Thus, the total number of colors required in a total coloring of is at most colors, which shows that satisfies TCC. ∎
Note that if be a class I graph then the would be a type I graph.
References

[1]
Max Alekseyev (https://mathoverflow.net/users/7076/maxalekseyev
), Constructing a vector consisting of nonnegative entries, URL (version: 20200210):
https://mathoverflow.net/q/352401  [2] Bermond, Jean‐Claude. ”Nombre Chromatique Total Du Graphe R‐Parti Complet.” Journal of the London Mathematical Society 2.2 (1974): 279285.
 [3] M. Behzad, Graphs and their chromatic numbers, Doctoral Thesis, Michigan State University, 1965.
 [4] J. Geetha, N. Narayanan and K. Somasundaram, Total coloring A Survey, https://arxiv.org/abs/1812.05833.
 [5] Godsil, Chris, and Gordon F. Royle. Algebraic graph theory. Vol. 207. Springer Science and Business Media, 2013.
 [6] Stong, Richard A. ”On 1factorizability of Cayley graphs.” Journal of Combinatorial Theory, Series B 39.3 (1985): 298307.
 [7] Dobson, Edward, et al. ”Vertextransitive CIS graphs.” European Journal of Combinatorics 44 (2015): 8798.
 [8] V. G. Vizing, Some unsolved problems in graph theory (in Russian),UspekhiMat. Nauk.(23) 117–134; English translation in Russian Math. Surveys23(1968), 125–141.
Comments
There are no comments yet.