Vulnerability refers to the ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. In this paper, the rupture degree… Click to show full abstract
Vulnerability refers to the ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. In this paper, the rupture degree of graphs is employed to measure the vulnerability of uniform linear hypergraphs. First, we discuss the bounds of the rupture degrees of k-uniform linear hypergraphs. Then, we give a recursive algorithm for computing the rupture degree of k-uniform hypertrees.
               
Click one of the above tabs to view related content.