A measure of graph vulnerability: Scattering number (Q1608152): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:49, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A measure of graph vulnerability: Scattering number |
scientific article |
Statements
A measure of graph vulnerability: Scattering number (English)
0 references
12 August 2002
0 references
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.
0 references
scattering number
0 references
measure of graph vulnerability
0 references
binomial tree
0 references