期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

完全二部图K_(6,n)(6≤n≤38)的点可区别E-全染色 被引量：5

Vertex-Distinguishing E-Total Coloring of Complete Bipartite Graph K_(6,n) with 6≤n≤38
下载PDF
导出
摘要 考虑完全二部图K_(6,n)(6≤n≤38)的点可区别E-全染色.利用组合分析法、反证法及构造染色的方法,给出一类特殊完全二部图的点可区别E-全染色.结果表明:当6≤n≤10时,K_(6,n)的点可区别E-全色数为5;当11≤n≤38时,K_(6,n)的点可区别E-全色数为6. We considered vertex-distinguishing E-total coloring of complete bipartite graph K6,n（6≤n≤38）,and gave the vertex-distinguishing E-total coloring of a class of special complete bipartite graph by using the methods of combinatorial analysis,reduction to absurdity and constructing concrete colorings.The results show that the vertex-distinguishing E-total chromatic number of complete bipartite graph K6,nis 5 when 6≤n≤10 and is 6 when 11≤n≤38.
作者 师志凤 陈祥恩 王治文 SHI Zhifeng;CHEN Xiang＇en;WANG Zhiwen(College of Mathematics and Statistics,North-west Normal University,Lanzhou 730070,China;School of Mathematics and Statistics,Ningxia University,Yinchuan 750021,China)
机构地区 西北师范大学数学与统计学院 宁夏大学数学统计学院
出处 《吉林大学学报（理学版）》 CAS CSCD 北大核心 2018年第4期845-852,共8页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:11761064 61163037 11261046) 宁夏回族自治区"百人计划"项目
关键词 完全二部图 E-全染色 点可区别E-全染色 点可区别E-全色数 complete bipartite graph E-total coloring vertex-distinguishing E-total coloring vertex-distinguishing E-total chromatic number
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献7

二级参考文献41

  • 1ZHANG Zhongfu,LI Jingwen,CHEN Xiang’en,YAO Bing, WANG Wenjie & QIU Pengxiang Institute of Applied Mathematic, Lanzhou Jiaotong University, Lanzhou 730070, China,College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China,College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China.D(β)-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2006,49(10):1430-1440. 被引量：54
  • 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. 被引量：173
  • 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. 被引量：78
  • 4陈祥恩.n-方体的点可区别全色数的渐近性态[J].西北师范大学学报（自然科学版）,2005,41(5):1-3. 被引量：16
  • 5安明强,刘信生,陈祥恩.关于几类特殊图的Mycielski图的点可区别全色数[J].西北师范大学学报（自然科学版）,2005,41(5):4-7. 被引量：3
  • 6BALISTER P N, RIORDAN O M, SCHELP R H. Vertex distinguishing edge colorings of graphs[J]. J Graph Theory, 2003, 42: 95-109.
  • 7BURRIS A C, SCHELP R H. Vertex- distinguishing proper edge-colorings [J]. J Graph Theory, 1997, 26(2): 73-82.
  • 8HARARY F, PLANTHOLT M. The point- distinguishing chromatic index [C]//HARARYF, MATBEE J S. Graphs and Application. New York: Wiley Interscience, 1985: 147-162.
  • 9HORNAK M, SOTAK R. The fifth jump of the point-distinguishing chromatic index of Kn,n [J]. Ars Combinatoria, 1996, 42:233-242.
  • 10CHEN 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.

共引文献27

同被引文献44

引证文献5

二级引证文献5

吉林大学学报（理学版）
2018年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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