On agglomeration-based rupture degree in networks and a heuristic algorithm

Abstract

The rupture degree is one the most important vulnerability parameter in networks which are modelled by graphs. Let G(V (G),E (G)) be a simple undirected graph. The rupture degree is defined by r(G) = max{w(G–S )–|S |–m(G–S ):S ⊂ V (G) and w(G–S )>1} where m(G–S ) is the order of a largest connected component in G–S and w(G–S ) is the number of components of G–S, respectively. In this paper, we consider the vertex contraction method based on the network agglomeration operation for each vertex of G. Then, we have presented two graph vulnerability parameters called by agglomeration rupture degree and average lower agglomeration rupture degree. Furthermore, the exact values of them for some graph families are given. Finally, we proposed a polynomial time heuristic algorithm to obtain the values of agglomeration rupture degree and average

Keywords

• graphs
• network design and communication
• complex networks
• connectivity
• vulnerability
• rupture degree
• agglomeration