Vulnerability of complex networks under three-level-tree attacks

DOI10.1016/J.PHYSA.2016.06.130MaRDI QIDQ1619910zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 13 November 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2016.06.130

zbMATH Keywords

complex networksdegreetree-attackvulnerability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Principles of Distributed Systems
• Vulnerability of complex networks under intentional attack with incomplete information
• Vulnerability of robust preferential attachment networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• EFFECT OF ATTACK ON SCALE-FREE NETWORKS DUE TO CASCADING FAILURE

Cites work

• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Vertex-degree sequences in complex networks: new characteristics and applications

Cited in

(2)

• Damage attack on complex networks
• Vulnerability of complex networks under intentional attack with incomplete information

This page was built for publication: Vulnerability of complex networks under three-level-tree attacks

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