Chinese Quarterly Journal of Mathematics ›› 2008, Vol. 23 ›› Issue (4): 621-624.

Previous Articles     Next Articles

Adjacent Vertex Distinguishing Total Coloring of M(Tn)

  

  1. 1. College of Information Science and Engineering,Shandong University of Science and Technology,Qingdao 266510,China2. Department of Mathematics,Tongji University,Shanghai 200092,China
  • Received:2005-09-26 Online:2008-12-30 Published:2023-09-19
  • About author:GU Yu-ying(1980-), female, native of Taian, Shandong, engages in graph theory and complex network.
  • Supported by:
     Supported by Natural Science Foundation of China(60503002);

Abstract: A k-proper total coloring of G is called adjacent distinguishing if for any two adjacent vertices have different color sets.According to the property of trees,the adjacent vertex distinguishing total chromatic number will be determined for the Mycielski graphs of trees using the method of induction.

Key words: total coloring, adjacent vertex distinguishing total coloring, Mycielski graph

CLC Number: