A measure of graph vulnerability: Scattering number
From MaRDI portal
(Redirected from Publication:1608152)
Recommendations
- A measure of graphs vulnerability: edge scattering number
- Scattering number in graphs
- A metric to compare vulnerability of the graphs of different sizes
- Computing the Scattering Number of Graphs
- Wiener index and vulnerability parameters of graphs
- Vertex-neighbor-scattering number of graphs.
- Computation of graph vulnerability measures and topological indices
- The Shields-Harary indices of vulnerability of a graph
- Edge-neighbor-scattering number of graphs
- The average scattering number of graphs
Cited in
(16)- Scattering number of digraphs
- Vertex-neighbor-scattering number of trees
- Vertex-neighbor-scattering number of graphs.
- The isolated scattering number of graphs
- A metric to compare vulnerability of the graphs of different sizes
- Vulnerability parameters of split graphs
- Relationships between scattering number and other vulnerability parameters
- Scattering number in graphs
- Graphs of scramble number two
- The scattering number of strictly chordal graphs: linear time determination
- The average scattering number of graphs
- Vertex-neighbor-scattering number of bipartite graphs
- The scattering number of thorn graphs
- General \(p\)-neighbor scattering number of graphs
- Scattering number and Cartesian product of graphs
- The scattering number and integrity of the complete \(k\)-ary trees
This page was built for publication: A measure of graph vulnerability: Scattering number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608152)