学术
摘 要:
图的全染色概念是点染色和边染色的推广，图的所有元素（顶点和边）都将染色且任相邻或关联的元素染色不同．邻点可区分的全染色是在正常全染色的定义上，使得相邻顶点的色集（C（v））不同．本文给出了P^n，Sn及其构造：Hajós sum，部分点替换图的邻点可区别的相邻顶点可区分的全染色．[著者文摘]
文章出处:
《山东科学》-2007年20卷5期 -6-9页
分 类 号:
文献标识码:
A
文章编号:
1002-4026（2007）05-0006-04
The Adjacent Vertex-Distinguishing Total Coloring of Two Types of Graphs
LIU Ping, WANG Yan-ni, WANG Li-wei （ School of Mathematics, Shandong Normal University, Jinan 250014, China ）
Abstract:
The total coloring is a generalization of the dot and edge coloring, and all of the elements （vertices and edges）of a graph are colored in such a way that no two adjacent or incident elements are colored identically. The adjacent vertex-distinguish total coloring is a total colors and the colors sets of two adjacent vertices are different.The adjacent vertex-distinguishing total coloring numbers of graph P^n, Sn, their Hajós sum and part of the substituted graphs of vertices are given in this paper.[著者文摘]
Key words:
adjacent vertex-distinguishing total coloring; adjacent vertex-distinguishing total coloring numbers; graph P^n, Sn ; Hajós sum; part of the substituted graphs of verteices
基金资助:
国家自然科学基金资助项目（60673047）
更多>>免费文章
cqvip.com