首页 | 本学科首页   官方微博 | 高级检索  
     检索      

关于图Wm×Wn的邻点可区别E-全染色的两个界
引用本文:王立丽,张伟东,凌昭昭,李沐春.关于图Wm×Wn的邻点可区别E-全染色的两个界[J].甘肃科学学报,2014,26(6):1-5.
作者姓名:王立丽  张伟东  凌昭昭  李沐春
作者单位:兰州交通大学数理学院,甘肃兰州,730070
基金项目:国家自然科学基金,甘肃省自然科学基金,甘肃省硕导基金
摘    要:利用组合分析法和构造染色的方法,讨论图Wm×Wn的邻点可区别E-全染色,得到了Wm×Wn的邻点可区别E-全色数,进一步验证了图的邻点可区别E-全染色猜想.

关 键 词:笛卡尔积图  邻点可区别E-全染色  邻点可区别E-全色数

Two Bounds of Adjacent Vertex-distinguishing E-Total Coloring of Wm ×Wn
WANG Li-li,ZHANG Wei-dong,LING Zhao-zhao,LI Mu-chun.Two Bounds of Adjacent Vertex-distinguishing E-Total Coloring of Wm ×Wn[J].Journal of Gansu Sciences,2014,26(6):1-5.
Authors:WANG Li-li  ZHANG Wei-dong  LING Zhao-zhao  LI Mu-chun
Institution:( School of Mathematics and Physics, Lanzhou Jiaotong University, Lanzhou 730070, China)
Abstract:The combinatorial analysis method and the constructional coloring method were adopted to discuss the adjacent vertex-distinguishing E-total coloring of WWm×Wn and obtain the adjacent vertex-distinguishing E-total chromatic number ofWm×Wn, which further validated the adjacent vertex distinguishing E-total coloring conjecture.
Keywords:Cartesian product graph  Adjacent vertex distinguishing E-total coloring  Adjacent vertex distinguishing E-total chromatic number
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号