Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900724 | Applied Mathematics and Computation | 2018 | 6 Pages |
Abstract
For a given graph G=(V,E), denote by m(G) and Ï(G) the order of the largest component and the number of components of G, respectively. The scattering number of G is defined as s(G)=max{Ï(GâX)â|X|:XâV,Ï(GâX)>1}, and the rupture degree r(G)=max{Ï(GâX)â|X|âm(GâX):XâV(G),Ï(GâX)>1}. These two parameters are related to reliability and vulnerability of networks. In this paper, we present some new bounds on the scattering number and rupture degree of a graph G in terms of its connectivity κ(G) and genus γ(G). Furthermore, we give graphs to show these bounds are best possible.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yinkui Li, Ruijuan Gu,