Measuring the robustness of a network using minimal vertex covers

DOI10.1016/J.MATCOM.2014.04.001MaRDI QIDQ2229891zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Eduardo Saenz-de-Cabezon, Henry P. Wynn

Publication date 18 February 2021

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2014.04.001

zbMATH Keywords

covering degreecovering indexnetwork robustnessminimal vertex covers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A novel measure of edge and vertex centrality for assessing robustness in complex networks
• The vertex attack tolerance of complex networks
• Extremal Results on Vertex and Link Residual Closeness
• Optimal attack and reinforcement of a network
• Measuring the impact of MVC attack in large complex networks

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 1565322 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Combinatorial Commutative Algebra
• Emergence of Scaling in Random Networks
• Reducibility among combinatorial problems
• The Structure and Function of Complex Networks

Cited in

(6)

• On robust clusters of minimum cardinality in networks
• The algebraic method in tree percolation
• Measuring robustness of superpeer topologies
• Types of signature analysis in reliability based on Hilbert series
• Stable network topologies using the notion of covering
• Measuring the impact of MVC attack in large complex networks

Describes a project that uses

Uses Software

• NetworkX

This page was built for publication: Measuring the robustness of a network using minimal vertex covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229891)