Toughness, Hamiltonicity and spectral radius in graphs
From MaRDI portal
Publication:2701002
DOI10.1016/J.EJC.2023.103701OpenAlexW4225614411MaRDI QIDQ2701002FDOQ2701002
Authors: Dandan Fan, Huiqiu Lin, 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
Cites Work
- A sharp upper bound of the spectral radius of graphs
- Spectral condition for Hamiltonicity of a graph
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral radius and Hamiltonian graphs
- Spectral radius and Hamiltonian properties of graphs
- Spectral radius and Hamiltonicity of graphs
- Problems in algebraic combinatorics
- A bound on the spectral radius of graphs
- Not every 2-tough graph is Hamiltonian
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Long cycles in graphs with prescribed toughness and minimum degree
- Title not available (Why is that?)
- Long cycles in graphs with large degree sums
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- The spectrum and toughness of regular graphs
- An Ore-type condition for Hamiltonicity in tough graphs
- Hamiltonian degree conditions for tough graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Toughness and the existence ofk-factors
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity
- Title not available (Why is that?)
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Toughness in pseudo-random graphs
- Graph toughness from Laplacian eigenvalues
- A Proof of Brouwer's Toughness Conjecture
Cited In (14)
- Factors, spectral radius and toughness in bipartite graphs
- Graph toughness from Laplacian eigenvalues
- Toughness, hamiltonicity and spectral radius in graphs
- Toughness and spectral radius in graphs
- Toughness, forbidden subgraphs, and Hamilton-connected graphs
- Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
- Binding number, \(k\)-factor and spectral radius of graphs
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
- A spectral condition for a graph to have strong parity factors
- Toughness and distance spectral radius in graphs involving minimum degree
- Toughness and nonhamiltonicity of polyhedral graphs
- The spectral radius and \(k\)-power of Hamilton cycle of graphs
- Spectral bounds for the vulnerability parameters of graphs
- Toughness and normalized Laplacian eigenvalues of graphs
This page was built for publication: Toughness, Hamiltonicity and spectral radius in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701002)
