期刊文献+

关于C_m·S_n和C_mΔS_n的全染色 被引量:2

On the Total Coloring of C_m·S_n and C_mΔS_n
下载PDF
导出
摘要 设m≥3,n≥2V(Cm.Sn)={ui|i=1,2,…,m}∪{vij|i=1,2,…,m;j=1,2,…,n},E(Cm.Sn)={u1u2,u2u3,…,u(m-1)um,umu1}∪{uivij|i=1,2,…,m;j=1,2,…,n}则称Cm.Sn为m个Sn(星)的心联图.V(CmΔSn)={ui|i=1,2,…,m}∪{vij|i=1,2,…,m;j=1,2,…,n},E(CmΔSn)={v11v21,v21v31,…,v(m-1)1vm1,vm1v11}∪{uivij|i=1,2,…,m;j=1,2,…,n}则称CmΔSn为m个Sn(星)的沿联图.本文给出Cm·Sn和CmΔSn全染色以及全色数. Let m≥3,n≥2 V(Gm·Sn)={ui|=1,2,…,m}∪{vij|i=1,2,…,m;j=1,2,…,n}, E(Cm·Sn)={u1u2,u2u3,…,u(m-1)um,umu1}∪{uivij|i=1,2,…,m;,j=1,2,…,n} this graph is called joined heart graph of Cm·Sn. And V(Cm△Sn)={ui|=1,2,…,m}∪{vij|i=1,2,…,m;j=1,2,…,n}, E(Cm△Sn)={v11v21,v21v31,…,v(m-1)1vm1,vm1v11}∪{uivij|i=1,2,…,m;j=1,2,…,n} this graph is called joined out-neighbor graph of Cm△Sn. In this paper, the total coloring of Cm·Sn and Cm△Sn is presented, and the complete chromatic number of Cm·Sn and Cm△Sn is obtained.
出处 《兰州交通大学学报》 CAS 2006年第6期147-149,共3页 Journal of Lanzhou Jiaotong University
关键词 心联图 沿联图 全染色 全色教 star heart join-graph cycle vertex join-graph total coloring total chromatic number
  • 相关文献

参考文献4

  • 1Bondy J A,Marty U S R.Graph theory withApplications[M].New York:Macmillan Press Ltd,1976.
  • 2Zhang Zhongfu,Wang Jianfang.A summary of the progress on total coloring of graphs[J].Adv Math,1992,21(4):390-397.
  • 3张忠辅,吴蓓莉.全图及其若干应用[J].兰州铁道学院学报,1990,9(4):21-27. 被引量:1
  • 4Hansen P,Marcotte O,Graph coloring and application AMS providence[M].Rhode Island,1999.

同被引文献12

  • 1张忠辅,陈祥恩,李敬文,姚兵,吕新忠,王建方.关于图的邻点可区别全染色[J].中国科学(A辑),2004,34(5):574-583. 被引量:192
  • 2张忠辅,任志国,刘君,包世堂,赵传成.关于S_m∨S_n的边色数和邻强边色数[J].运筹与管理,2006,15(1):6-8. 被引量:2
  • 3Bondy J A,Murty U S A.Graph Theory with Applications[M].The Macmillan Press Ltd,1976.
  • 4Balister P N, Riordan O M, Schelp R H. Vertex-distinguishing edge colorings of graphs[J]. J. Graph Theory, 2003: 42: 95-109.
  • 5Zhang Z F, Liu L Z, Wang J F. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15: 623-626.
  • 6Chartrand G, Linda L F. Graphs and diagraphs[ M]. Ind edition Wadswirth Brokks/Cole, Monterey, CA(1986).
  • 7Hansen P, Marcottc O. Graph coloring and application AMS providence[ M]. Rhode Island USA,1999.
  • 8Zhao C C, Liu J, Ren Z G, Bao S T, Zhang Z F. On the vertext-distinguhing total coloring of Pm V fn[J] . International Journal of Pure and Applied Mathematics, 2007, (4) : 29-34.
  • 9Bondy J A, Marty U S R. Graph theory with applications[ M]. The Macmillan Press Ltd, New York, 1976.
  • 10Burris A C s ScheIp R H, Vertex-diatinguishing proper edge-colorings [ J ], J of Graph Theory , 1997 , 26920 : 73- 82.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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