首页 | 本学科首页   官方微博 | 高级检索  
     检索      

推广的Petersen图的相邻顶点可区分的全染色
引用本文:王丽伟,刘萍,王颜妮.推广的Petersen图的相邻顶点可区分的全染色[J].山东科学,2007,20(6):4-8.
作者姓名:王丽伟  刘萍  王颜妮
作者单位:山东师范大学数学科学学院,山东,济南,250014
摘    要:图的全染色概念是点染色和边染色的推广,图的所有元素(顶点和边)都将染色且任相邻或关联的元素染色不同.邻点可区分的全染色是在正常全染色的定义上,使得相邻顶点的色集不同.本文给出了推广的Petersen图的相邻顶点可区分的全染色.

关 键 词:邻点可区分的全染色  邻点可区分的全色数  推广的Petersen图
文章编号:1002-4026(2007)06-0004-05
收稿时间:2007-03-04
修稿时间:2007年3月4日

On Adjacent Vertex-Distinguishing Total Coloring of Generalized Petersen Graph
WANG Li-wei,LIU Ping,WANG Yan-ni.On Adjacent Vertex-Distinguishing Total Coloring of Generalized Petersen Graph[J].Shandong Science,2007,20(6):4-8.
Authors:WANG Li-wei  LIU Ping  WANG Yan-ni
Abstract:The Total Coloring of a graph is a generalization of the vetex and edge coloring,in which all of the elements(vertices and edges)are colored in such a way that no any two adjacent or correlative elements are colored indentically.The adjacent vertex-distinguish total coloring is a normal total coloring and the colors sets of two adjacent vertices are different.In this paper,the adjacent vertex-distinguishing total coloring numbers of generalized Petersen graph are presented.
Keywords:adjacent vertex-distinguishing total coloring  the adjacent vertex-distinguishing total coloring number  generalized Petersen graph
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号