Enhancing the robustness of scale-free networks

DOI10.1088/1751-8113/42/19/195003zbMath1179.05103arXiv0905.2227OpenAlexW3104648547MaRDI QIDQ3630098

Jichang Zhao, Ke Xu

Publication date: 2 June 2009

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.2227

zbMATH Keywords

robustnessnumerical experimentsgraphscomplex networkserror toleranceattack vulnerabilityenforcing parameter

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Dynamical systems involving maps of trees and graphs (37E25)

Related Items (2)

Network robustness and random processes ⋮ Using shortcut edges to maximize the number of triangles in graphs

This page was built for publication: Enhancing the robustness of scale-free networks