Abstract
Let G=(V,E) be a graph. The weak rupture degree of G is defined as rw(G)=max{ω(G−X)−|X|−me(G−X):ω(G−X)>1}, where the maximum is taken over all X, the subset of V(G), ω(G−X) is the number of components in G−X, and me(G−X) is the size (edge number) of a largest component in G−X. This is an important parameter to quantitatively describe the invulnerability of networks. In this paper, based on a study of relationship between network structure and the weak rupture degree, a polynomial algorithm for computing the weak rupture degree of trees is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
