A Measure of Graphs Vulnerability: Edge Scattering Number
Journal: Bulletin of the International Mathematical Virtual Institute (Vol.4, No. 1)Publication Date: 2014-11-27
Authors : Ersin Aslan;
Page : 53-60
Keywords : Vulnerability; network design and communica- tion; connectivity; edge connectivity; integrity; edge integrity; scattering number.;
Abstract
In a communication network, several vulnerability measures are used to determine the resistance of the network to disruption of operation after the failure of certain stations or communication links. This study intro- duces a new vulnerability parameter, edge scattering number. The edge scattering number of a noncomplete connected graph G is dened to be es(G) = maxf!(G
Other Latest Articles
- Quadruple Coincidence Point Results in Partially Ordered Metric Space
- Double diffusive convention in a non-Newtonian fluid saturaded porous layer with through flow
- Signed Graph Equations: N(?) ? CMD(?); CMD(?) ? MD(?); MD(?) ? L(?)
- An upper bound to the second Hankel determinant for a subclass of avayitic functions
- Fokker?Planck Equation in n Dimensional Vector Space
Last modified: 2015-01-09 19:00:49