期刊文献+

k-方体图的Smarandachely邻点全染色 被引量:1

On the Smarandachely Adjacent Vertex Total Coloring of k-Cube Graph
下载PDF
导出
摘要 研究了k-方体图Qk(V,E)的Smarandachely邻点全染色,证明了关于图的Smarandachely邻点全染色猜想于k-方体图成立,r-正则图G(V,E)的Smarandachely邻点全色数sχat(G)=Δ(G)+2,其中sχat(G)表示G(V,E)的Smarandachely邻点全色数。 The paper studied the Smarandachely adjacent vertex total coloring of k-cube graph and χ sat(G) is proved to equal Δ(G) +2,where Δ(Q k) is maximum degree of graph Q k.So it is right for the conjecture of the Smarandachely adjacent vertex total chromatic number.
作者 梁少卫
出处 《唐山学院学报》 2009年第3期6-7,共2页 Journal of Tangshan University
关键词 k-方体图 Smarandachely邻点全染色 Smarandachely邻点全色数 k-cube graph Smarandachely adjacent vertex total coloring Smarandachely adjacent vertex total chromatic number
  • 相关文献

参考文献1

二级参考文献8

  • 1Burris A C,Schelp R H.Vertex-distinguishing proper edge-colorings.J of Graph Theory,1997,26(2): 73-82
  • 2Bazgan C,Harkat-Benhamdine A,Li H,et al.On the vertex-distinguishing proper edge-coloring of graphs.J Combin Theory,Ser B,1999,75: 288-301
  • 3Balister P N,Bollobas B,Schelp R H.Vertex distinguishing colorings of graphs with △(G)=2.Discrete Mathematics,2002,252(2): 17-29
  • 4Zhang Zhongfu,Liu Linzhong,Wang Jianfang.Adjacent strong edge coloring of graphs.Applied Mathematics Letters,2002,15:623-626
  • 5Dietel Reinhard.Graph Theory.New York:Springer-Verlag,1997
  • 6Chartrand G,Lesniak-Foster L.Graph and Digraphs.2nd Edition.Monterey,CA: WadsworthBrooks/Cole,1986
  • 7Hansen P,Marcotte O.GraphColoring and Application.Providence: AMS,1999
  • 8Bondy J A,Murty U S R.Graph Theory with Applications.New York: American Elsevier,1976

共引文献191

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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