Toughness and spectral radius in graphs

DOI10.1016/j.disc.2024.114191zbMATH Open1547.0517MaRDI QIDQ6611738

Yuanyuan Chen, Dandan Fan, Huiqiu Lin

Publication date: 27 September 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spectral radiustoughnessbipartite toughness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• The spectrum and toughness of regular graphs
• Spectral extrema of graphs: forbidden hexagon
• On toughness and \((g,f)\)-factors in bipartite graphs
• Bipartite toughness and \(k\)-factors in bipartite graphs
• Toughness and the existence of k-factors. II
• A bound on the spectral radius of graphs
• Toughness and the existence of \(k\)-factors. III
• 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
• Toughness and spectrum of a graph
• Toughness, hamiltonicity and split graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Graph toughness from Laplacian eigenvalues
• Toughness, Hamiltonicity and spectral radius in graphs
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• Some Inequalities for the Largest Eigenvalue of a Graph
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• Toughness and the existence ofk-factors
• Two sufficient conditions for a 2-factor in a bipartite graph
• A Proof of Brouwer's Toughness Conjecture
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Toughness and spectral radius in graphs