论文信息 - Hyper-Hamiltonicity in graphs: some sufficient conditions

Hyper-Hamiltonicity in graphs: some sufficient conditions

Abstract A Hamiltonian graph G is hyper-Hamiltonian if G − v is Hamiltonian for any v ∈ V ( G ) . In this paper, we give some sufficient conditions for a graph to be hyper-Hamiltonian. We provide both, spectral and non-spectral conditions for hyper-Hamiltonicity.

Cybele T. M. Vinagre | Renata R. Del-Vecchio | Guilherme B. Pereira | R. Del-Vecchio | Guilherme B. Pereira

[1] Steve Butler,et al. Small Spectral Gap in the Combinatorial Laplacian Implies Hamiltonian , 2010 .

[2] F. Harary,et al. Hamiltonian threshold graphs , 1987, Discret. Appl. Math..

[3] Lih-Hsing Hsu,et al. Hyper-Hamiltonian generalized Petersen graphs , 2008, Comput. Math. Appl..

[4] Bo Zhou,et al. Signless Laplacian spectral radius and Hamiltonicity , 2010 .

[5] R. Merris. Degree maximal graphs are Laplacian integral , 1994 .

[6] Vladimir Nikiforov,et al. Spectral radius and Hamiltonicity of graphs , 2009, 0903.5353.

[7] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[8] O. Ore. Note on Hamilton Circuits , 1960 .

[9] P. Hammer,et al. Aggregation of inequalities in integer programming. , 1975 .

[10] Huiqing Liu,et al. Spectral radius and Hamiltonian graphs , 2012 .

[11] John Adrian Bondy,et al. A method in graph theory , 1976, Discret. Math..