AVDTC numbers of generalized Halin graphs with maximum degree at least 6

作者：Chen Xiang en^*; Zhang Zhong fu

来源：Acta Mathematicae Applicatae Sinica-English Series, 2008, 24(1): 55-58.

DOI：10.1007/s10255-005-5222-8

• graph
• total coloring
• adjacent-vertex-distinguishing total coloring
• adjacent-vertex-distinguishing total chromatic number

In a paper by Zhang and Chen et al.(see [11]), a conjecture was made concerning the minimum number of colors chi(at) (G) required in a proper total-coloring of G so that any two adjacent vertices have different color sets, where the color set of a vertex v is the set composed of the color of v and the colors incident to v. We find the exact values of chi(at)(G) and thus verify the conjecture when G is a Generalized Halin graph with maximum degree at least 6. A generalized Halin graph is a 2-connected plane graph G such that removing all the edges of the boundary of the exterior face of G (the degrees of the vertices in the boundary of exterior face of G are all three) gives a tree.

• 出版日期2008
• 单位西北师范大学