A measure of graph vulnerability: Scattering number

DOI10.1155/S0161171202012607MaRDI QIDQ1608152zbMATH OpenFDO

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, http://www.hindawi.com/journals/ijmms/volume-30/S0161171202012607.html

zbMATH Keywords

binomial treemeasure of graph vulnerabilityscattering number

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85)

Review text

Summary: The scattering number of a graph \(G\), denoted \(\text{sc} (G)\), is defined by \(\text{sc} (G)=\max\{ c (G-S)- |S|:S\subseteq V (G)\) and \(c (G-S)\neq 1\}\) where \(c (G-S)\) denotes the number of components in \(G-S\). It is one measure of graph vulnerability. In this paper, general results on the scattering number of a graph are considered. Firstly, some bounds on the scattering number are given. Further, the scattering number of a binomial tree is calculated. Also several results are given about binomial trees and graph operations.

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

(17)

• The scattering number of strictly chordal graphs: linear time determination
• A metric to compare vulnerability of the graphs of different sizes
• Scattering number in graphs
• The isolated scattering number of graphs
• Vertex-neighbor-scattering number of trees
• The average scattering number of graphs
• The scattering number and integrity of the complete k-ary trees
• Vertex-neighbor-scattering number of bipartite graphs
• Vertex-neighbor-scattering number of graphs.
• Relationships between scattering number and other vulnerability parameters
• The scattering number of thorn graphs
• General p-neighbor scattering number of graphs
• Scattering number and Cartesian product of graphs
• Vulnerability parameters of split graphs
• Scattering number of digraphs
• Graphs of scramble number two
• Vertex vulnerability in wrapped butterfly network

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)