On the Adjacent Vertex-Distinguishing Total Coloring of Two Classes of Product Graphs
Received:December 28, 2004  Revised:June 27, 2005
Key Words: product graphs   adjacent vertex-distinguishing total coloring   adjacent vertex-distinguishing total chromatic number.  
Fund Project:
Author NameAffiliation
TIAN Shuang-liang Department of Mathematics, Northwest Minorities University, Gansu 730030, China 
CHEN Ping College of Economics and Management, Northwest Minorities University, Gansu 730030, China 
Hits: 2622
Download times: 1315
Abstract:
      It is proved that if $ n\geq2$, then $\chi_{at}(K_n\times K'_n)=2n$, and if $ p,\,q\geq2$, then $\chi_{at}(C_{2p}\times K_{2q})=2q+3$, where $K_n\times K'_n$ is the product of two complete graphs with different labels, and $C_{2p}\times K_{2q}$ is the product of an even cycle and a complete graph of even order.
Citation:
DOI:10.3770/j.issn:1000-341X.2007.04.013
View Full Text  View/Add Comment