Measuring the robustness of a network using minimal vertex covers

  1. Sáenz-De-Cabezón, E. 2
  2. Wynn, H.P. 1
  1. 1 London School of Economics and Political Science
    info

    London School of Economics and Political Science

    Londres, Reino Unido

    ROR https://ror.org/0090zs177

  2. 2 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Aldizkaria:
Mathematics and Computers in Simulation

ISSN: 0378-4754

Argitalpen urtea: 2014

Alea: 104

Orrialdeak: 82-94

Mota: Artikulua

DOI: 10.1016/J.MATCOM.2014.04.001 SCOPUS: 2-s2.0-84902549277 WoS: WOS:000338602300008 GOOGLE SCHOLAR

Beste argitalpen batzuk: Mathematics and Computers in Simulation

Gordailu instituzionala: lockSarbide irekia Editor

Lotura duten proiektuak

Álgebra homológica algorítmica con aplicaciones a la fiabilidad de redes y al procesamiento de imágenes biomédicas.

2014/00070/001

Laburpena

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