期刊文献+

星和扇上的锥的D(2)-点可区别正常边染色

On the D(2)-vertex Distinguishing Proper Edge Coloring of Cones over Star and Fan
下载PDF
导出
摘要 设G是顶点集合为V(G)={v0i|i=1,2,…,p}的简单图,n是正整数,称Mn(G)为G上的锥(或广义Mycielski图),如果V(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…,vn1,vn2,…,vnp,w},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n-1}∪{vnjw|1≤j≤p}.在这篇文章里,我们讨论了星和扇上的锥的D(2)-点可区别的正常边染色,并给出了相应色数. Let G be a simple graph with V(G)={v0i|i=1,2,…,p},n is a positive integer.The graph Mn(G) is called cones over graph G(or Generalized Mycielski Graph of G),ifV(Mn(G))={v01,v02,…,v0p;v11,v12,…,v1p;…,vn1,vn2,…,vnp,w},E(Mn(G))=E(G)∪{vijv(i+1)k|v0jv0k∈E(G),1≤j,k≤p,i=0,1,…,n-1}∪{vnjw|1≤j≤p}. In this paper,we obtain the D(2)-vertex distinguishing proper edge chromatic number of cones over star and fan.
作者 刘利群
出处 《甘肃联合大学学报(自然科学版)》 2007年第3期12-15,共4页 Journal of Gansu Lianhe University :Natural Sciences
关键词 D(2)-点可区别的正常边染色 D(2)-点可区别的正常边色数 图上的锥 D(2)-vertex distinguishing proper edge coloring D(2)-vertex distinguishing proper edge chromatic number cones over graphs
  • 相关文献

参考文献6

  • 1[1]BURRIS A C,Schelp R H.Vertex-Distinguishing proper edge-colorings[J].Graph Theory,1997,26 (2):73-83.
  • 2[2]BAZGAN C,HARKAT-BENHAMDINE A,HAO LI,etc.On the vertex-distinguishing proper edge-colorings of graphs[J].Combin Theory B,1999(75):288-301.
  • 3[3]BALISTER P N,BOLLOB(A)S B,SCHELP R H.Vertex-distinguishing colorings of graphs with (G)=2[J].Discrete Math,2002 (252):17-29.
  • 4[4]BALISTER P N,RIORDAN O M,SCHELP R H.Vertex-distinguishing edge colorings of graphs[J].Graph Theory,2003(42):95-109.
  • 5[5]ZHANG Zhong-fu,LIU Lin-zhong,WANG Jian-fang.Adjacent strong edge coloring of graphs[J].Applied Mathematics Letters,2002(15):623-626.
  • 6[7]TARDIF C.Fraetional chromatic numbers of cones over graphs[J].Graph Theory,2001(38):87-94.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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