A polynomial algorithm for computing the weak rupture degree of trees

Zongtian Wei, Chao Yue, Yinkui Li, Hongyun Yue and Yong Liu

Applied Mathematics and Computation, 2019, vol. 361, issue C, 730-734

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.

Keywords: Graph; Weak rupture degree; Tree; Algorithm; Complexity (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304849
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:361:y:2019:i:c:p:730-734

DOI: 10.1016/j.amc.2019.06.019

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().