期刊文献+

哈密尔顿连通图与邻域并条件

Hamiltonian-Connected Graphs with Neighborhood Unions
下载PDF
导出
摘要 记G=(V,E)表示简单图,NC=min{|N(x)∪N(y)|:x,y∈V(G),xy∈E(G)},NC2=min{|N(x)∪N(y)|:x,y∈V(G),d(x,y)=2}。1989年Faudree等4个美国著名图论专家研究课题NC≥(2n+1)/3的哈密尔顿连通图,得到:若3连通n阶图G,NC≥(2n+1)/3,则G是哈密尔顿连通图。本文进一步研究NC2≥(2n+1)/3的哈密尔顿连通图,得到界为最好的结果:若3连通n阶通图G,NC2≥(2n+1)/3,则G是哈密尔顿连通图。而且本文的证明极其简捷。 Let G be a sample graph,NC=min{|N(x)∪N(y)|:x,y∈V(G),xy∈E(G)},NC2=min{|N(x)∪N(y)|:x,y∈V(G),d(x,y)=2}.IN 1989,Faudree et.al obtained that if 3connected graph G of order n with NC≥(2n+1)/3,then G be hamiltonianconnected graph.In this paper the author shows that if 3connected graph G of order n with NC2≥(2n+1)/3,then G be hamiltonianconnected graph.
作者 赵克文
机构地区 琼州大学数学系
出处 《信息工程大学学报》 2003年第2期99-100,共2页 Journal of Information Engineering University
关键词 哈密尔顿连通图 邻域并条件 hamiltonnian-connected graphs neighborhood unions paths
  • 相关文献

参考文献6

  • 1[1]Fa udree R J, Gould RJ, Jacobson MS, Schelp RH.Neighborhood unions and hamiltonian properies in graphs[J].J Combinatorics Theory, 1989,47: 1 - 9.
  • 2[2]Fa udree RJ, Gould RJ, Jacobin MS, Lesniam L.Neighborhood unions and highly hamilton graphs [J]. Ars Combinatoria, 1991,31: 139 - 148.
  • 3[3]Lindquester TE. The effects of distance and neighborhood unions conditions on hamiltonian properties in graphs [J] . J Graph Theory( 1989,13:335 - 352.
  • 4[4]Liu Bolian, Lou Dingjun, Zhao Kerwn. Aneighborhood union condition for pancyclicity[ J ]. Austral. J Combinatorice, 1995,12:81 -91.
  • 5[5]Gould R J, Lindquester TE. Some extremal problems invoving adjacency conditions at distance two, in recent studies in Graph Theory ( ed by Kulli VE ) [ M ] . Vishwa international publications, 1989,140 - 148.
  • 6[6]Faudree RJ, Could RJ, Jacobson MS, Schelp RH, RH.Extremal probllems involving neighborhood unions [ J ]. J Graph Theory, 1987,11:555 - 564

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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