Link Vulnerability in Networks

DOI10.1142/S0129054118500144zbMath1387.05242OpenAlexW2801708519MaRDI QIDQ4640344

Zeynep Nihan Odabaş Berberler, Esin Yigit

Publication date: 17 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054118500144

zbMATH Keywords

vulnerabilitycomplex networksnetwork topologiescloseness

Mathematics Subject Classification ID

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

Related Items (5)

Extremal Results on Vertex and Link Residual Closeness ⋮ Computational complexity of network vulnerability analysis ⋮ Additional Closeness of Cycle Graphs ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ Additional Closeness and Networks Growth

Cites Work

• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• Recognizing tough graphs is NP-hard
• On a class of posets and the corresponding comparability graphs
• Measuring the vulnerability for classes of intersection graphs
• Connectivity and edge-disjoint spanning trees
• Tough graphs and Hamiltonian circuits.
• Residual Closeness in Cycles and Related Networks
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
• Multiscale vulnerability of complex networks
• Network robustness and residual closeness
• Edge‐tenacious networks
• Computing the Scattering Number of Graphs
• Rupture degree of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Link Vulnerability in Networks