Sufficient spectral conditions for graphs being $k$-edge-Hamiltonian or $k$-Hamiltonian

Abstract

A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$. A graph $G$ is $k$-Hamiltonian if for all $S\subseteq V(G)$ with $|S|\le k$, the subgraph induced by $V(G)\setminus S$ has a Hamiltonian cycle. These two concepts are classical extensions for the usual Hamiltonian graphs. In this paper, we present some spectral sufficient conditions for a graph to be $k$-edge-Hamiltonian and $k$-Hamiltonian in terms of the adjacency spectral radius as well as the signless Laplacian spectral radius. Our results could be viewed as slight extensions of the recent theorems proved by Li and Ning [Linear Multilinear Algebra 64 (2016)], Nikiforov [Czechoslovak Math. J. 66 (2016)] and Li, Liu and Peng [Linear Multilinear Algebra 66 (2018)]. Moreover, we shall prove a stability result for graphs being $k$-Hamiltonian, which could be regarded as a complement of two recent results of Füredi, Kostochka and Luo [Discrete Math. 340 (2017)] and [Discrete Math. 342 (2019)].

Theorems & Definitions (41)

• Theorem 1.1: Ore ore60, Bondy Bondy72
• Theorem 1.2: Erdős erdos62
• Corollary 1.3: Erdős
• Theorem 1.4: Fiedler--Nikiforov FiedlerNikif
• Theorem 1.5: Yu--Fan YF13
• Theorem 1.6: Li--Ning LiBinlong
• Theorem 1.7: Li--Ning LiBinlong
• Theorem 1.8: Nikiforov Niki16
• Theorem 1.9: Li--Liu--Peng LLPLMA18
• Theorem 2.1