Spectral bounds for the vulnerability parameters of graphs

DOI10.1007/S40314-024-02595-9MaRDI QIDQ6125428zbMATH OpenFDO

Authors Hongzhang Chen, Jianxi Li, Wai Chee Shiu

Publication date 11 April 2024

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-024-02595-9

zbMATH Keywords

(normalized) Laplacian eigenvaluesintegrityscattering numbersignless Laplacian spectral radiustenacity

Mathematics Subject Classification ID

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

Recommendations

• Relationships between scattering number and other vulnerability parameters
• Scattering number in graphs
• A measure of graphs vulnerability: edge scattering number
• Computing the tenacity of some graphs

Cites work

• -connectivity, integrity, tenacity, toughness and eigenvalues of graphs
• A catalogue of small maximal nonhamiltonian graphs
• A new eigenvalue bound for independent sets
• A proof of Brouwer's toughness conjecture
• Computing the Scattering Number of Graphs
• Connectivity and eigenvalues of graphs with given girth or clique number
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Eigenvalue bounds for independent sets
• Graph theory with applications
• Graph toughness from Laplacian eigenvalues
• Hoffman's ratio bound
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 861347 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• On a class of posets and the corresponding comparability graphs
• Scattering number and extremal non-Hamiltonian graphs
• Spectra of graphs
• The integrity of a cubic graph
• The spanning k-trees, perfect matchings and spectral radius of graphs
• Tough Ramsey graphs without short cycles
• Toughness and normalized Laplacian eigenvalues of graphs
• Toughness and spectrum of a graph
• Toughness, Hamiltonicity and spectral radius in graphs
• Vertex-connectivity and eigenvalues of graphs with fixed girth

Cited in

(1)

• Two variants of toughness of a graph and its eigenvalues

This page was built for publication: Spectral bounds for the vulnerability parameters of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6125428)