\(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs

DOI10.1007/s40840-022-01381-2zbMath1501.05015OpenAlexW4294176233MaRDI QIDQ2091163

Hongzhang Chen, Jian Xi Li

Publication date: 31 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01381-2

zbMATH Keywords

eigenvaluestenacitytoughnessintegrity\(\ell\)-connectivity

Mathematics Subject Classification ID

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

Related Items (1)

Spectral bounds for the vulnerability parameters of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Toughness and normalized Laplacian eigenvalues of graphs
• Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number
• A new eigenvalue bound for independent sets
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• 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

This page was built for publication: \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs