Adjacent vertex-distinguishing total colorings of Ks V Kt

作者：Feng Yun; Lin Wensong^*

来源：Journal of Southeast University (english Edition), 2013, 29(2): 226-228.

DOI：10.3969/j.issn.1003-7985.2013.02.021

• Adjacent vertices
• Color sets
• Complete graphs
• Empty graph
• Join graphs
• K-coloring
• Total chromatic number
• Total coloring

Let G be a simple graph and f be a proper total k-coloring of G. The color set of each vertex v of G is the set of colors appearing on v and the edges incident to v. The coloring f is said to be an adjacent vertex-distinguishing total coloring if the color sets of any two adjacent vertices are distinct. The minimum k for which such a coloring of G exists is called the adjacent vertex-distinguishing total chromatic number of G. The join graph of two vertex-disjoint graphs is the graph union of these two graphs together with all the edges that connect the vertices of one graph with the vertices of the other. The adjacent vertex-distinguishing total chromatic numbers of the join graphs of an empty graph of order s and a complete graph of order t are determined.

• 出版日期2013
• 单位东南大学