Relationships between scattering number and other vulnerability parameters
From MaRDI portal
Publication:4831401
DOI10.1080/00207160410001661690zbMATH Open1054.05063OpenAlexW1979029613MaRDI QIDQ4831401FDOQ4831401
Authors: Shuying Peng, Shenggui Zhang
Publication date: 29 December 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160410001661690
Recommendations
Cites Work
- Graph theory with applications
- Tough graphs and Hamiltonian circuits.
- On a class of posets and the corresponding comparability graphs
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- Scattering number and extremal non-Hamiltonian graphs
- Computing the Scattering Number of Graphs
- A catalogue of small maximal nonhamiltonian graphs
- Scattering number and modular decomposition
- Scattering number in graphs
Cited In (7)
- Models and methods for solving the problem of network vulnerability
- Vulnerability parameters of split graphs
- Scattering number in graphs
- The scattering number of strictly chordal graphs: linear time determination
- The average scattering number of graphs
- A polynomial algorithm for weighted scattering number in interval graphs
- Solitude number at 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)