学术
摘 要:
对一个简单图G的一个正常全染色，来说，G的点v的色集合C（v）是与v关联的边的颜色以及点v的颜色所构成的集合．对此f，如果G的任意两个相邻顶点的色集合不同，则称，为G的邻点可区别全染色．对G进行邻点可区别全染色所需要的最少颜色数称为G的邻点可区别全色数．对图rK2∨K8的邻点可区别全色数进行了讨论．[著者文摘]
文章出处:
《兰州大学学报：自然科学版》-2007年43卷5期 -91-93页
栏目信息:
分 类 号:
文献标识码:
A
文章编号:
0455-2059（2007）05-0091-03
On the adjacent-vertex-distinguishing total chromatic number of rK2∨ K8
CHEN Xiang-en （College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China）
Abstract:
For a proper total coloring f of a simple G, the color set of a vertex v of G is the set of colors of edges incident with v together with the color assigned to v. For f, if any pair adjacent vertices have different color sets, then f is called an adjacent-vertex-distinguishing total coloring. The minimum number of colors in an adjacent-vertex-distinguishing total coloring is called the adjacent-vertex-distinguishing total chromatic number of G. The adjacent-vertex-distinguishing total chromatic number of rK2 ∨ Ks is discussed in this paper.[著者文摘]
Key words:
adjacent-vertex-distinguishing total coloring; adjacent-vertex-distinguishing total chromatic number; join of graphs
基金资助:
国家自然科学基金（10771091）,西北师范大学科技创新工程（NWNU-KJCXGC-3-18）和甘肃省教育厅科研基金（0501-02）资助项目.
更多>>免费文章
cqvip.com