Relationships between scattering number and other vulnerability parameters
From MaRDI portal
Publication:4831401
Recommendations
Cites work
- A catalogue of small maximal nonhamiltonian graphs
- Computing the Scattering Number of Graphs
- Graph theory with applications
- On a class of posets and the corresponding comparability graphs
- Scattering number and extremal non-Hamiltonian graphs
- Scattering number and modular decomposition
- Scattering number in graphs
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- Tough graphs and Hamiltonian circuits.
Cited in
(10)- The scattering number of strictly chordal graphs: linear time determination
- Solitude number at graphs
- Scattering number in graphs
- Models and methods for solving the problem of network vulnerability
- A polynomial algorithm for weighted scattering number in interval graphs
- Vulnerability parameters of split graphs
- Relationships between vertex attack tolerance and other vulnerability parameters
- A measure of graphs vulnerability: edge scattering number
- The average scattering number of graphs
- Spectral bounds for the vulnerability parameters of graphs
This page was built for publication: Relationships between scattering number and other vulnerability parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831401)