A measure of graph vulnerability: Scattering number
type: Item
instance of: scholarly article
title: A measure of graph vulnerability: Scattering number
zbMATH Open document ID: 0991.05065
DOI: 10.1155/S0161171202012607
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 2002-08-12T00:00:00Z
full work available at URL: https://eudml.org/doc/49315
full work available at URL: S0161171202012607.html
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.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1779093
zbMATH Keywords: scattering number
zbMATH Keywords: measure of graph vulnerability
zbMATH Keywords: binomial tree
author: Alpay Kirlangic
MaRDI profile type: Publication
Recommended article: Q2975726
Recommended article: Scattering number in graphs
Recommended article: A metric to compare vulnerability of the graphs of different sizes
Recommended article: Computing the Scattering Number of Graphs
Recommended article: Wiener index and vulnerability parameters of graphs
Recommended article: Q4649999
Recommended article: Q4636170
Recommended article: The Shields-Harary indices of vulnerability of a graph
Recommended article: Q3070212
Recommended article: The average scattering number of graphs
description: scientific article; zbMATH DE number 1779093