Spectral bounds for the vulnerability parameters of graphs
From MaRDI portal
Publication:6125428
DOI10.1007/s40314-024-02595-9MaRDI QIDQ6125428
Wai Chee Shiu, Hongzhang Chen, Jian Xi Li
Publication date: 11 April 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
tenacityintegritysignless Laplacian spectral radiusscattering number(normalized) Laplacian eigenvalues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- Eigenvalue bounds for independent sets
- Scattering number and extremal non-Hamiltonian graphs
- A catalogue of small maximal nonhamiltonian graphs
- On a class of posets and the corresponding comparability graphs
- The integrity of a cubic graph
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Interlacing eigenvalues and graphs
- Vertex-connectivity and eigenvalues of graphs with fixed girth
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs
- Toughness and normalized Laplacian eigenvalues of graphs
- Connectivity and eigenvalues of graphs with given girth or clique number
- A new eigenvalue bound for independent sets
- Hoffman's ratio bound
- 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
- Computing the Scattering Number of Graphs
- A Proof of Brouwer's Toughness Conjecture
- The spanning k-trees, perfect matchings and spectral radius of graphs
This page was built for publication: Spectral bounds for the vulnerability parameters of graphs
