Toughness, Hamiltonicity and spectral radius in graphs
From MaRDI portal
Publication:2701002
DOI10.1016/j.ejc.2023.103701MaRDI QIDQ2701002
Huiqiu Lin, Dandan Fan, Hongliang Lu
Publication date: 27 April 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.02257
Related Items
Spectral bounds for the vulnerability parameters of graphs, Binding number, \(k\)-factor and spectral radius of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral condition for Hamiltonicity of a graph
- The spectrum and toughness of regular graphs
- Spectral radius and Hamiltonian graphs
- Long cycles in graphs with large degree sums
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity
- A bound on the spectral radius of graphs
- Problems in algebraic combinatorics
- A sharp upper bound of the spectral radius of graphs
- Tough Ramsey graphs without short cycles
- Long cycles in graphs with prescribed toughness and minimum degree
- Hamiltonian degree conditions for tough graphs
- Toughness and spectrum of a graph
- Not every 2-tough graph is Hamiltonian
- An Ore-type condition for Hamiltonicity in tough graphs
- Toughness in pseudo-random graphs
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Graph toughness from Laplacian eigenvalues
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Toughness and the existence ofk-factors
- Spectral radius and Hamiltonian properties of graphs
- A Proof of Brouwer's Toughness Conjecture
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Spectral radius and Hamiltonicity of graphs
