期刊文献+

K_(2n-1)×K_(2n+1)'的邻点可区别全染色 被引量:1

The Vertex-Distinguishing Total Coloring of Adjacent K_(2n-1)×K_(2n+1)′
下载PDF
导出
摘要 基于完全图的全染色和邻强边染色,得到了相邻奇数阶完全图的直积图K2n-1×K2n+1'的邻点可区别全色数χat(K2n-1×K2n+1')=4n(n为正整数). In this paper,the adjacent vertex-distinguishing total coloring number on K2n-1×K2n+1′ was obtained in view of the total coloring and the adjacent strong edge coloring of Complete graphs.It is proved that at(K2n-1×K2n+1′) is 4n.
作者 张琛 王欣欣
出处 《佳木斯大学学报(自然科学版)》 CAS 2013年第3期464-466,共3页 Journal of Jiamusi University:Natural Science Edition
基金 陇东学院青年科技创新项目(XYZK1110) 陇东学院青年科技创新项目(XYZK1207)
关键词 完全图 直积图 邻点可区别全染色 邻点可区别全色数 complete graph cartesian product of graph adjacent vertex-distinguishing total coloring the adjacent vertex-distinguishing total coloring number
  • 相关文献

参考文献4

二级参考文献14

  • 1ZHANG 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
  • 2陈祥恩,张忠辅,晏静之,张贵仓.关于几类特殊图的Mycielski图的邻点可区别全色数(英文)[J].兰州大学学报(自然科学版),2005,41(2):117-122. 被引量:13
  • 3张忠辅,李敬文,陈祥恩,程辉,姚兵.图的距离不大于β的任意两点可区别的边染色[J].数学学报(中文版),2006,49(3):703-708. 被引量:96
  • 4陈祥恩,张忠辅.P_m×K_n的邻点可区别全色数(英文)[J].Journal of Mathematical Research and Exposition,2006,26(3):489-494. 被引量:16
  • 5张忠辅,李敬文,陈祥恩,姚兵,王文杰,仇鹏翔.图的距离不大于β的点可区别的全染色[J].中国科学(A辑),2006,36(10):1119-1130. 被引量:72
  • 6BONDY J A,MURTY U S R.Graph Theory with Applications[M].New York:Macmillan,Longdon and Elsevier,1976.
  • 7SUN Yan-li,SUN Lei.The (adjacent) vertexdistinguishing total coloring of the mycielski graphs and the cartesian product graphs[J].submited
  • 8BONDY J A,MURTY U S R. Graph theory with applications [M]. New York: Macmillan, 1976.
  • 9ZHANG Zhongfu. Adjacent strong edge coloring of graphs [J]. Applied Mathematices Letters, 2002,15 : 623-626.
  • 10AKIYAMA J, CHEN Y C, MIKIO K, et al. 7th China-Japan conference, discrete geometry, combinatorics and graph theory [C]. Berlin Heidelberg: Springer-Verlag, 2007,200-205.

共引文献178

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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