期刊文献+

W_m∨W_n的邻强边色数(英文)

On the adjacent vertex-distinguishing edge chromatic number of W_m∨W_n
下载PDF
导出
摘要 得到了Wm∨Wn的邻点可区别边色数,其中Wm与Wn分别表示m+1阶和n+1阶的轮, Wm∨Wn表示Wm和Wn的联图. The adjacent vertex-distinguishing edge chromatic number of join graph of wheel Wm and wheel Wn is obtained in this paper, where Win, Wn denote wheels with order m + 1 and wheels with order n + 1, respectively.
出处 《兰州大学学报(自然科学版)》 CAS CSCD 北大核心 2007年第1期113-115,共3页 Journal of Lanzhou University(Natural Sciences)
基金 Supported by the National Natural Science Foundation of China(40301037).
关键词 联图 邻强边色数 wheel join-graph adjacent vertex-distinguishing edge chromatic number
  • 相关文献

参考文献8

  • 1HENSEN P,MARCOTTE O.Graph coloring and application[M].Rhode Island,USA:AMS Providence,1999.
  • 2CERNY J,HORNAK M,SOTAK R.Observability of a graph[J].Math Slovaca,1996,46:21-31.
  • 3BURRIS A C,SCHELP R H.Vertex-distinguishing proper edge-colorings[J].J of Graph Theory,1997,26(2):73-82.
  • 4BAZGAN C,HARKAT BENHAMDINE A,LI H,et al.On the vertex-distinguishing proper edge-coloring of graph[J].J Combin Theory Ser B,1999,75:288-301.
  • 5BALISTER P N,BOLLOBAS B,SCHELP R H.Vertex distinguishing coloring of graphs with △(G)=2[J].Discrete Mathematics,2002,252(2):17-29.
  • 6BALISTER P N,RIORDAN O M,SCHELP R H.Vertex-distinguishing edge coloring of graphs[J].J Graph Theory,2003,42:95-109.
  • 7BONDY J A,MARTY U S R.Graph Theory with Applications[M].New York:The Macmillan Press,1976.
  • 8LIU Jun,ZHAO Chuan-cheng,REN Zhi-guo,et al.Verter-distinguishig edge chromatic number of Pm ∨ Rn and Tn,2[J].Journal of,Lanzhou University(Natural Sciences),2006,42(4):104-106.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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