Chinese Quarterly Journal of Mathematics ›› 2008, Vol. 23 ›› Issue (4): 621-624.
Previous Articles Next Articles
Received:
Online:
Published:
About author:
Supported by:
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:
 
O157.5
GU Yu-ying, WANG Shu-dong. Adjacent Vertex Distinguishing Total Coloring of M(Tn)[J]. Chinese Quarterly Journal of Mathematics, 2008, 23(4): 621-624.
/ Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: https://sxjk.magtechjournal.com/EN/
https://sxjk.magtechjournal.com/EN/Y2008/V23/I4/621