๐”– Bobbio Scriptorium
โœฆ   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

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.

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:

Hamiltonicity of 4-connected graphs
โœ Hao Li; Feng Tian; Zhi Xia Xu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Institute of Mathematics, Chinese Academy of Scien ๐ŸŒ English โš– 230 KB