Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
From MaRDI portal
Publication:6115877
DOI10.1080/03081087.2022.2093321zbMath1529.05104arXiv2109.01973OpenAlexW3196328165WikidataQ114100547 ScholiaQ114100547MaRDI QIDQ6115877
Publication date: 10 August 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.01973
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient spectral conditions on Hamiltonian and traceable graphs
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Spectra of graphs
- Arc coverings of graphs
- On a conjecture of V. Nikiforov
- A method in graph theory
- The spectral radius of trees on \(k\) pendant vertices
- A sharp upper bound of the spectral radius of graphs
- Spectral results on Hamiltonian problem
- Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- A stability version for a theorem of Erdős on nonhamiltonian graphs
- A variation of a theorem by Pósa
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- On Hamilton's ideals
- On Hamiltonian bipartite graphs
- Spectral radius and Hamiltonicity of graphs with large minimum degree
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Some Inequalities for the Largest Eigenvalue of a Graph
- Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
- On three conjectures involving the signless Laplacian spectral radius of graphs
- On graphs with randomly deleted edges
- Spectral radius and Hamiltonian properties of graphs
- Some generalizations of spectral conditions for 2s-hamiltonicity and 2s-traceability of bipartite graphs
- Spectral radius and Hamiltonian properties of graphs, II
- Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
- Generalization of a Theorem of Posa
- n-Hamiltonian graphs
- Variations on the Hamiltonian Theme
- Some Theorems on Abstract Graphs
- Graphs and matrices
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian