Let G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of order n such that for all u, ve V(G), 2 where dist(u,v) is the distance between u and v in G, then either G is hamiltonian, or G is a spanning subgraph of a graph in one of three families of exceptional graphs.
โฆ LIBER โฆ
Structural Properties and Hamiltonicity of Neighborhood Graphs
โ Scribed by Ingo Schiermeyer; Martin Sonntag; Hanns-Martin Teichert
- Publisher
- Springer Japan
- Year
- 2010
- Tongue
- English
- Weight
- 914 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Neighborhood unions and hamiltonicity of
โ
Ruqun Shen; Feng Tian
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 530 KB
Mengerian properties, hamiltonicity, and
โ
E. Flandrin; H. Li
๐
Article
๐
1994
๐
John Wiley and Sons
๐
English
โ 603 KB
Powers of connected graphs and hamiltoni
โ
M. Paoli
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 783 KB
Spectral radius and Hamiltonicity of gra
โ
Miroslav Fiedler; Vladimir Nikiforov
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 91 KB
Let G be a graph of order n and ฮผ(G) be the largest eigenvalue of its adjacency matrix. Let G be the complement of G. Write K n-1 + v for the complete graph on n -1 vertices together with an isolated vertex, and K n-1 + e for the complete graph on n -1 vertices with a pendent edge. We show that:
Neighborhood unions and hamiltonian prop
โ
R.J Faudree; Ronald J Gould; Michael S Jacobson; R.H Schelp
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 617 KB
Hamiltonicity of 4-connected graphs
โ
Hao Li; Feng Tian; Zhi Xia Xu
๐
Article
๐
2010
๐
Institute of Mathematics, Chinese Academy of Scien
๐
English
โ 230 KB