Relationships between scattering number and other vulnerability parameters

DOI10.1080/00207160410001661690zbMath1054.05063OpenAlexW1979029613MaRDI QIDQ4831401

Shuying Peng, Sheng Gui 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

zbMATH Keywords

vulnerabilitytenacitytoughnessintegrityscattering number

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (4)

The scattering number of strictly chordal graphs: linear time determination ⋮ A polynomial algorithm for weighted scattering number in interval graphs ⋮ The average scattering number of graphs ⋮ Models and methods for solving the problem of network vulnerability

Cites Work

• Unnamed Item
• Scattering number and extremal non-Hamiltonian graphs
• A catalogue of small maximal nonhamiltonian graphs
• On a class of posets and the corresponding comparability graphs
• Scattering number and modular decomposition
• Tough graphs and Hamiltonian circuits.
• Scattering number in graphs
• Computing the Scattering Number of Graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: Relationships between scattering number and other vulnerability parameters