期刊文献+

推广的Petersen图的相邻顶点可区分的全染色 被引量:2

On Adjacent Vertex-Distinguishing Total Coloring of Generalized Petersen Graph
下载PDF
导出
摘要 图的全染色概念是点染色和边染色的推广,图的所有元素(顶点和边)都将染色且任相邻或关联的元素染色不同.邻点可区分的全染色是在正常全染色的定义上,使得相邻顶点的色集不同.本文给出了推广的Petersen图的相邻顶点可区分的全染色. 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.
出处 《山东科学》 CAS 2007年第6期4-8,共5页 Shandong Science
基金 国家自然科学基金资助项目(60673047)
关键词 邻点可区分的全染色 邻点可区分的全色数 推广的Petersen图 adjacent vertex-distinguishing total coloring the adjacent vertex-distinguishing total coloring number generalized Petersen graph
  • 相关文献

参考文献4

  • 1ZHONG Z F.On the Adjacent Vertex-Distinguish Total Coloring of Graphs[J]. Science in Claim Scr A,2004, (10) :574 - 583.
  • 2董海燕,孙磊,孙艳丽.关于邻点可区别全染色的几个新结果[J].广西师范大学学报(自然科学版),2005,23(3):41-43. 被引量:8
  • 3BOOIDB S B. Modem Graph Theory[ M]. New York: Springer-Verlag, 1998:145- 177.
  • 4V OIGT MA. On List Colomings and Choosability of Graphs[ DB/OL]. 1998. http://math mathematik tu-ilmenau de/- voigt/gesl, ps.

二级参考文献6

  • 1陈仪朝,苏健基.可伸缩图和极小图的一些性质[J].广西师范大学学报(自然科学版),2004,22(2):32-36. 被引量:2
  • 2Balister P N,Bollobás B,Shelp R H. Vertex distinguishing coloring of graphs with Δ(G)=2[J].DiscreteMathematics,2002,252:17-29.
  • 3Zhang Zhongfu,Liu Linzhong,Wang Jianfang. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters,2002,15:623-626.
  • 4Zhang Zhongfu. On the adjacent vertex-distinguish total coloring of graphs [J]. Science in China Ser A, 2004, 10:574-583.
  • 5Bollobás B. Modern graph theory[M]. New York:Springer-Verlag,1998. 145-177.
  • 6杨爱峰,原晋江.图的相邻强边着色数(英文)[J].郑州大学学报(理学版),2004,36(2):7-9. 被引量:3

共引文献7

同被引文献14

  • 1黄新,高太平.基于交叉立方体环连接的Petersen图互联网络研究[J].中北大学学报(自然科学版),2006,27(2):141-143. 被引量:8
  • 2田双亮.一类广义Petersen图的邻强边染色[J].西北民族大学学报(自然科学版),2007,28(1):1-3. 被引量:5
  • 3Erd's P,Simonovits M,S'os V T.Anti-Ramsey theorems[C]∥Infinite and Finite Sets:Ⅱ.Colloquia Mathematica Societatis,Keszthely,1973:657-665.
  • 4Jiang Tao,Pikhurko O.Anti-Ramsey numbers of doubly edge critical graphs[EB/OL].[2008-09-02].http:∥www.math.cmu.edu/pikhurko.
  • 5Jiang Tao.Anti-Ramsey numbers of subdivide graphs[J].J Combin Theory:B,2002,85:361.
  • 6Schiermeyer I.Rainbow numbers for matchings and complete graphs[J].Discrete Mathematics,2004,286:157.
  • 7Béla B.Modern graph theory[M].New York:Springer-Verlag,1998:108-110.
  • 8BURRIS A C, SCHELP R H. Vertex-distinguishing proper edge-coloring[J]. J Graph Theory, 1997, 26(2): 70-82.
  • 9ZHANG Z F, LIU L Z, WANG J F. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15(5): 623-626.
  • 10VIZINC V G. Some unsolved problems in graph theory[J]. Uspekhi Mat Nauk, 1968, 23: 117-134.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部