期刊文献+

若干直积图的Smarandachely邻点全染色 被引量:6

On the Smarandachely Adjacent Vertex Total Coloring of Some Direct Products
原文传递
导出
摘要 运用分析法和构造Smarandachely邻点全染色函数法研究了若干直积图的Smarandachely邻点全色数,进一步验证了图的Smarandachely邻点全染色猜想. Application of analytic method and constructing the Smarandachely-adjacent vertex total coloring function, the Smarandachely-adjacent vertex total chromatic number of some Direct products are obtained. Furthermore, the Smarandachely-adjacent vertex total coloring conjecture is checked.
出处 《数学的实践与认识》 CSCD 北大核心 2012年第5期192-197,共6页 Mathematics in Practice and Theory
基金 国家自然科学基金(11061017) 甘肃省自然科学基金(1010RJZA075) 甘肃省领导基金(1104-10)
关键词 直积图 Smarandachely邻点全染色 Smarandachely邻点全色数 direct products smarandachely-adjacent vertex total coloring smarandachely- adjacent vertex total chromatic number
  • 相关文献

参考文献7

  • 1ZHANG Zhongfu,CHEN Xiang’en,LI Jingwen,YAO Bing,LU Xinzhong,WANG Jianfang.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:179
  • 2Chen Xiang'en. On the adjacent vertex distinguishing total coloring laumbers of graphs with /k = 3[J]. Discrete Mathematics, 2008(308): 4003-4007.
  • 3Zhang Zhongfu. The Smarandachely-adjacent-vertex total coloring of graphs[J], http://202.201.18. 40:8080.
  • 4Jaradat M M M. On the edge coloring of graph products[J]. International Journal of Mathematics and Mathematical Sciences, 2005, 16: 2669-2676.
  • 5Zhang Zhonffu, Liu Linzhong, Wang Jianfang. Adjacent strong edge coloring of graphs[J]. Appl Math Lett, 2002, 15(5): 623-626.
  • 6李沐春,强会英,晁福刚,张忠辅.完全二部图广义Mycielski图的邻点可区别全色数与邻强边色数[J].数学的实践与认识,2008,38(19):147-152. 被引量:15
  • 7Douglas B West.图论导引[M].李建中,骆吉洲,译.北京:机械工业出版社,2006.

二级参考文献8

  • 1ZHANG Zhongfu,CHEN Xiang’en,LI Jingwen,YAO Bing,LU Xinzhong,WANG Jianfang.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Mathematics,2005,48(3):289-299. 被引量:179
  • 2陈义.轮图的广义Mycielski图的邻强边色数[J].经济数学,2003,20(2):77-80. 被引量:3
  • 3Liu Linzhong,Zhang Zhongfu, Wang Jianfang. On the adjacent strong edge coloring of outer plane graphs[J].Mathematics Reserch and Exposition, 2005,25 : 255-266.
  • 4Liu Linzhong, Li Yingzheng, Zhang Zhongfu. On the adjacent strong edge coloring of halin graphs [J]. Mathematics Reserch and Exposition, 2003,23 : 241-246.
  • 5Zhang Zhongfu, et al. The adjacent strong edge chromatic number of graphs[J]. Applied Mathematics Letters, 2002,15:623-626.
  • 6李敬文 张忠辅.一些图的Mycielski图的邻强边色数.兰州交通大学学报,2005,24(3):133-135.
  • 7Bondy JA, Murty USR. Graph Theory with Applicatives[M]. New York, The Macmillan Press, Ltd,1976.
  • 8Bums,A. C,Schelp,R. H.Vertex-distinguishing proper edge-colorings, J[].of Graph Theory.1997

共引文献193

同被引文献40

引证文献6

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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