Title of article :
Hamiltonian-connected graphs
Author/Authors :
Zhao Kewen، نويسنده , , Hongjian Lai، نويسنده , , Ju Zhou، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2008
Abstract :
For a simple graph G, let . In this paper, we prove that if NCD(G)≥V(G), then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended.
Keywords :
Hamiltonian path , Hamiltonian graphs , Hamiltonian-connected graphs , Neighborhood union , Degree condition
Journal title :
Computers and Mathematics with Applications
Journal title :
Computers and Mathematics with Applications
