scientific article; zbMATH DE number 6836971

MaRDI QIDQ3134300zbMATH OpenFDO

Authors Murat Ersen Berberler, Zeynep Nihan Odabaş Berberler

Publication date 9 February 2018

zbMATH Keywords

heuristicsintegritynetwork vulnerability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• On vulnerability measures of networks
• Bound and exact methods for assessing link vulnerability in complex networks
• Effective measurement of network vulnerability under random and intentional attacks
• Vulnerability of complex networks
• A vulnerability parameter of networks
• Vulnerability and controllability of networks of networks
• scientific article; zbMATH DE number 2100568
• Vulnerability of complex network structures and systems

Cited in

(15)

• On Integrity of Harary Graphs
• Integrity of graph operations
• Exponential Domination Critical and Stability in Some Graphs
• Global distribution center number of some graphs and an algorithm
• Vulnerability in graphs: the neighbour-integrity of line graphs
• On agglomeration-based rupture degree in networks and a heuristic algorithm
• Uniform integrity of graphs
• Exponential independence number of some graphs
• A vulnerability parameter of networks
• scientific article; zbMATH DE number 4130410 (Why is no real title available?)
• Integrity of some derived graphs
• The weighted integrity problem is polynomial for interval graphs
• Computing the integrity of Harary graphs
• A survey of integrity
• The edge-integrity of some graphs

This page was built for publication:

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