Library Header Image
LSE Research Online LSE Library Services

Measuring the robustness of a network using minimal vertex covers

Saenz-de-Cabezon, E. and Wynn, H. P. ORCID: 0000-0002-6448-1080 (2014) Measuring the robustness of a network using minimal vertex covers. Mathematics and Computers in Simulation, 104. pp. 82-94. ISSN 0378-4754

Full text not available from this repository.

Identification Number: 10.1016/j.matcom.2014.04.001


We define two quantities associated to each of the vertices of a simple graph, based on the collection of minimal vertex covers of the graph. They are called covering degree and covering index. We use them to describe new strategies for measuring the robustness of a network. We study the correlation between the defined quantities and other quantities used in the context of network attacks. Using the attack strategies associated to these quantities we study their effect on the connectedness of several network models. We also consider the complexity of the computation of the defined quantities and use a computational commutative algebra approach for their actual computation.

Item Type: Article
Official URL:
Additional Information: © 2014 IMACS
Divisions: LSE
Subjects: Q Science > QA Mathematics
Date Deposited: 20 May 2014 14:27
Last Modified: 25 Feb 2024 19:39

Actions (login required)

View Item View Item