A measure of graph vulnerability: Scattering number
From MaRDI portal
Publication:1608152
DOI10.1155/S0161171202012607zbMATH Open0991.05065MaRDI QIDQ1608152FDOQ1608152
Authors: Alpay Kirlangic 
Publication date: 12 August 2002
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/49315
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)
- 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
- Graphs of scramble number two
- Scattering number in graphs
- 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
- Scattering number of digraphs
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)
