Article ID Journal Published Year Pages File Type
8903508 Electronic Notes in Discrete Mathematics 2017 6 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Hyper-Hamiltonicity in graphs: some sufficient conditions
Authors
, , ,