期刊文献+

C_m∨C_n,C_m∨W_n,C_m∨F_n的点可区别Ⅰ-全染色和点可区别Ⅵ-全染色 被引量:9

Vertex-distinguishing Ⅰ-total Colorings and Vertex-distinguishing Ⅵ-total Colorings of C_m∨C_n,C_m∨W_n,C_m∨F_n
下载PDF
导出
摘要 利用构造具体染色的方法,讨论了圈与圈、圈与轮以及圈与扇的联图的点可区别Ⅰ-全染色和点可区别Ⅵ-全染色问题,确定了这3类图的点可区别Ⅰ-全色数和点可区别Ⅵ-全色数,同时说明了VDITC(Vertex-distinguishingⅠ-total colorings)猜想和VDVITC(Vertex-distinguishingⅥ-total colorings)猜想对于这三类图是成立的. In this paper,we consider the vertex-distinguishing Ⅰ-total colorings and vertex-distinguishing Ⅵ-total colorings of the join of a cycle and a cycle,a cycle and a wheel and a cycle and a fan.By constructing concrete colorings,we determine the vertex-distinguishing Ⅰ-total chromatic numbers and vertex-distinguishing Ⅵ-total chromatic numbers of the abovementioned three families of graphs.Results in this paper illustrate that the VDITC conjecture and VDVITC conjecture are valid for these graphs.
出处 《厦门大学学报(自然科学版)》 CAS CSCD 北大核心 2017年第6期870-875,共6页 Journal of Xiamen University:Natural Science
基金 国家自然科学基金(11761064 61163037 11261046) 宁夏回族自治区百人计划项目
关键词 Ⅰ-全染色 点可区别Ⅰ-全染色 点可区别Ⅰ-全色数 联图 Ⅰ-total coloring vertex distinguishingⅠ-total coloring vertex distinguishingⅠ-total chromatic number join graph
  • 相关文献

参考文献3

二级参考文献14

  • 1刘广军,刘信生.P_m∨W_n的点可区别全色数[J].郑州大学学报(理学版),2009,41(1):6-9. 被引量:2
  • 2ZHANG Zhongfu, CHEN Xiang’en, LI Jingwen, YAO Bing, LU Xinzhong & WANG Jianfang College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,Department of Computer, Lanzhou Normal College, Lanzhou 730070, China,Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China,Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:174
  • 3ZHANG ZhongFu,CHENG Hui,YAO Bing,LI JingWen,CHEN XiangEn,XU BaoGen.On the adjacent-vertex-strongly-distinguishing total coloring of graphs[J].Science China Mathematics,2008,51(3):427-436. 被引量:79
  • 4Burris A C and Schelp R H. Vertex-distinguishing proper edge-colorings[J]. J of Graph Theory, 1997, 26(2): 73-82.
  • 5Balister P N, Bollobgs B, Shelp R H. Vertex distinguishing colorings of graphs with Δ(G)=2[J]. Discrete Mathematics, 2002, 252(1-3): 17-29.
  • 6ZHANG Zhong-fu, QIU Peng-xiang, XU Bao-gen, et al. On the vertex-distinguishing total coloring of graphs[J]. Ars Combinatoria, 2008, 87: 33-45.
  • 7CHEN Xiang-en. Asymptotic behaviour of the vertex-distinguishing total chromatic numbers of n-cube[J]. Journal of Northwest Normal University (Natural Science), 2005, 41(5): 1-3.
  • 8ZHANG Zhong-fu, CHEN Xiang-en, LI Jingwen, et al. On the adjacent-vertex-distinguishing total coloring of graphs[J]. Science in China, Series A, 2004, 34(5): 574-583.
  • 9BURRIS A C, SCHELP R H. Vertex-distinguishing proper edge-colorings[J]. Journal of Graph Theory, 1997, 26(2): 73-82.
  • 10BALISTER P N, BOLLOBAs B, SCHELP R H. Vertex distinguishing colorings of graphs with lleG) = 2[J]. Discrete Mathematics, 2002, 252: 17-29.

共引文献8

同被引文献42

引证文献9

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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