Toughness and normalized Laplacian eigenvalues of graphs

DOI10.1016/j.amc.2022.127075OpenAlexW4221050160MaRDI QIDQ2139788

Shunlai Zhu, Xueyi Huang, Kinkar Chandra Das

Publication date: 19 May 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127075

zbMATH Keywords

toughnessalgebraic connectivitynormalized Laplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Density (toughness, etc.) (05C42)

Related Items (4)

Extremal normalized Laplacian spectral radii of graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs ⋮ On the normalized distance Laplacian eigenvalues of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The spectrum and toughness of regular graphs
• Eigenvalue bounds for independent sets
• Eigenvalues and perfect matchings
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Toughness in pseudo-random graphs
• A new eigenvalue bound for independent sets
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Laplacian spectral bounds for clique and independence numbers of graphs
• Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree
• Graph toughness from Laplacian eigenvalues
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• A Proof of Brouwer's Toughness Conjecture
• On graphs with equal algebraic and vertex connectivity

This page was built for publication: Toughness and normalized Laplacian eigenvalues of graphs