J4 ›› 2011, Vol. 46 ›› Issue (2): 45-50.

• Articles • Previous Articles     Next Articles

Vertex-distinguishing total coloring of some complement double graphs

WEN Fei1,  WANG Zhi-wen2,  WANG Hong-jie3,  BAO Shi-tang4,  LI Mu-chun1*,  ZHANG Zhong-fu1   

  1. 1. Insitute of Applied Mathematics,  Lanzhou Jiaotong University,  Lanzhou 730070,  Gansu, China;
    2. The Department of Mathematical and Computer,  Ningxia University,  Yinchuan 750021,  Gansu, China;
    3. Railway Technical of Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China;
    4. The Information Engineering Institute, Lanzhou City University, Lanzhou 730070, Gansu,  China
  • Received:2010-03-24 Online:2011-02-16 Published:2011-03-30


A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v.  The minimal number of colors required for a vertex distinguishing total coloring of G is called the vertex distinguishing total coloring chromatic number. The vertex distinguishing total chromatic number of some complement double graphs is obtained.

Key words: vertex distinguishing total coloring; vertex distinguishing total chromatic number; complement double graph

No related articles found!
Full text



No Suggested Reading articles found!