Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
From MaRDI portal
Publication:2075522
DOI10.1016/j.disc.2021.112774zbMath1482.05198OpenAlexW4200618359WikidataQ114190561 ScholiaQ114190561MaRDI QIDQ2075522
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112774
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
On sufficient conditions for Hamiltonicity of graphs, and beyond ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular factors and eigenvalues of regular graphs
- Regular factors of regular graphs from eigenvalues
- Spectra of graphs
- Eigenvalue bounds for independent sets
- Matchings in regular graphs from eigenvalues
- Long cycles in bipartite graphs
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- Interlacing eigenvalues and graphs
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- Note on edge-disjoint spanning trees and eigenvalues
- Spanning tree packing number and eigenvalues of graphs with given girth
- Edge-disjoint spanning trees and eigenvalues
- A note on Hamiltonian circuits
- On Hamiltonian bipartite graphs
- Regular Graphs, Eigenvalues and Regular Factors
- Note on Hamilton Circuits
- Eigenvalues of the Laplacian of a graph∗
- Merging the A-and Q-spectral theories
- Some Theorems on Abstract Graphs
- Spectral radius and Hamiltonicity of graphs
This page was built for publication: Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
