Toughness, Hamiltonicity and spectral radius in graphs

DOI10.1016/J.EJC.2023.103701MaRDI QIDQ2701002OpenAlexFDO

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

Mathematics Subject Classification ID

Basic linear algebra (15Axx) Graph theory (05Cxx) Algebraic combinatorics (05Exx)

Recommendations

• Toughness and spectral radius in graphs
• scientific article; zbMATH DE number 434902
• A sufficient condition for Hamiltonian cycles in tough graphs
• Toughness and distance spectral radius in graphs involving minimum degree

Cites work

• scientific article; zbMATH DE number 997668 (Why is no real title available?)
• scientific article; zbMATH DE number 68362 (Why is no real title available?)
• A bound on the spectral radius of graphs
• A proof of Brouwer's toughness conjecture
• A sharp upper bound of the spectral radius of graphs
• An Ore-type condition for Hamiltonicity in tough graphs
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Dirac's type sufficient conditions for hamiltonicity and pancyclicity
• Graph toughness from Laplacian eigenvalues
• Hamiltonian degree conditions for tough graphs
• Long cycles in graphs with large degree sums
• Long cycles in graphs with prescribed toughness and minimum degree
• Not every 2-tough graph is Hamiltonian
• Problems in algebraic combinatorics
• Some Inequalities for the Largest Eigenvalue of a Graph
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral condition for Hamiltonicity of a graph
• Spectral radius and Hamiltonian graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• The spanning k-trees, perfect matchings and spectral radius of graphs
• The spectrum and toughness of regular graphs
• Tough Ramsey graphs without short cycles
• Tough graphs and Hamiltonian circuits.
• Toughness and spectrum of a graph
• Toughness and the existence ofk-factors
• Toughness in graphs -- a survey
• Toughness in pseudo-random graphs

Cited in

(14)

• Toughness and distance spectral radius in graphs involving minimum degree
• Factors, spectral radius and toughness in bipartite graphs
• Toughness and nonhamiltonicity of polyhedral graphs
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• Toughness, hamiltonicity and spectral radius in graphs
• Toughness and spectral radius in graphs
• A spectral condition for a graph to have strong parity factors
• Toughness and normalized Laplacian eigenvalues of graphs
• The spectral radius and \(k\)-power of Hamilton cycle of graphs
• Binding number, \(k\)-factor and spectral radius of graphs
• \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
• Toughness and the existence of Hamiltonian \([a, b]\)-factors of graphs
• Graph toughness from Laplacian eigenvalues
• Spectral bounds for the vulnerability parameters 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)