期刊文献+

循环图C_n〈1,n/2〉的关联色数 被引量:1

Incidence chromatic number of circulant C_n〈1,n/2〉
下载PDF
导出
摘要 循环图具有很强的对称性,作为有价值的通讯网络拓扑已受到广泛的关注.对三度循环图C_n〈1,n/2〉进行了研究,完全确定了其关联色数. There are good symmetry in the eireulants. Communication network topology is largely focused because of its value of application. This paper is about 3--degree circulant, and get its in-cidence chromatic number.
出处 《山东理工大学学报(自然科学版)》 CAS 2008年第4期76-78,共3页 Journal of Shandong University of Technology:Natural Science Edition
关键词 循环图 三度循环图 关联色数 circulant 3-degree circulant incidence chromatic number
  • 相关文献

参考文献4

二级参考文献2

  • 1瞿晓鸿,硕士学位论文,1997年
  • 2邦迪 J A,图论及其应用,1984年,1页

共引文献29

同被引文献13

  • 1陈东灵,刘西奎,王淑栋.图的关联色数和关联着色猜想[J].经济数学,1998,15(3):47-51. 被引量:29
  • 2马刚,马明,张忠辅.皇冠图G_(n,m)的邻点可区别边色数[J].华东交通大学学报,2005,22(2):141-143. 被引量:6
  • 3Brualdi R A,Quinn Massey J J.Incidence and strong edge colorings of graphs[J].Discrete Math,1993,122:51-58.
  • 4Guiduli B.On incidence coloring and star arboricity of graphs[J].Discrete Mathematics,1997,163:275-278.
  • 5Algor I,Alon N.The star arboricity of graphs[J].Discrete Mathematics,1989,75:11-22.
  • 6Wang Shu-dong,Chen Dong-ling,Pang Shan-chen.The incidence coloring number of Halin graphs and outerplanar graphs[J].Discrete Mathematics,2002,256:397-405.
  • 7Mohammad H D,Sopena E,Zhu Xu-ding.Incidence coloring of k-degenerated graphs[J].Discrete Mathematics,2004,283:121-128.
  • 8Huang Cheng-i,Wang Yue-li,Chung S S.The incidence coloring numbers of meshes[J].Computers and Mathematics with Applications,2004,48:1 643-1 649.
  • 9Maksim M.The incidence coloring conjecture for graphs of maximum degree 3[J].Discrete Mathematics,2005,292:131-141.
  • 10Bondy J A,Murty U S R.Graph Theory with Application[M].New York:Macmillan Press LTD,1976.

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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