A measure of graph vulnerability: scattering number

Alpay Kirlangiç

International Journal of Mathematics and Mathematical Sciences, 2002, vol. 30, 1-8

Abstract:

The scattering number of a graph G , denoted sc ( G ) , is defined by sc ( G ) = max { c ( G − S ) − | S | : S ⫅ V ( G ) and c ( G − S ) ≠ 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, scattering number of a binomial tree is calculated. Also several results are given about binomial trees and graph operations .

Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/30/314575.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/30/314575.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:314575

DOI: 10.1155/S0161171202012607

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().