摘要
给出了几类特殊图相邻顶点可区别的全色数,如双路间和二部(V1,V2)间叠加匹配形成的系列图、双圈(prism)、双轮.并得到边连通度λ(G)=1的图相邻顶点可区别的全染色的性质.
In this paper, it presents the adjacent vertex-distinguishing total chromatic number of some graphs, such as sequences of graphs obtained by overlaying matchings to two paths or bipartition （V1, V2）, double cycle（prism）, double wheel, and a property of the adjacent vertex-distinguishing total coloring of graph with edge-connectivi-ty λ（G）=1.
出处
《西南师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2006年第4期1-4,共4页
Journal of Southwest China Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目(10471078).
关键词
相邻顶点可区别的全染色
相邻顶点可区别的全色数
匹配
边连通度
adjacent vertex distinguishing total coloring
adjacent vertex-distinguishing total chromatic number
matching
edge-connectivity
