Link vulnerability in networks

DOI10.1142/S0129054118500144zbMATH Open1387.05242OpenAlexW2801708519MaRDI QIDQ4640344FDOQ4640344

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

Recommendations

• A note on the link residual closeness of graphs under join operation
• Network robustness and residual closeness
• Residual closeness of wheels and related networks
• Residual closeness in cycles and related networks
• Residual closeness and generalized closeness

zbMATH Keywords

complex networksnetwork topologiesvulnerabilitycloseness

Mathematics Subject Classification ID

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

Cites Work

• Edge‐tenacious networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Measuring the vulnerability for classes of intersection graphs
• Tough graphs and Hamiltonian circuits.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a class of posets and the corresponding comparability graphs
• Rupture degree of graphs
• Connectivity and edge-disjoint spanning trees
• Recognizing tough graphs is NP-hard
• Multiscale vulnerability of complex networks
• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
• Computing the Scattering Number of Graphs
• Residual closeness in cycles and related networks
• Title not available (Why is that?)
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• Network robustness and residual closeness

Cited In (10)

• Node and link vulnerability in complete multipartite networks
• A Note on the Link Residual Closeness of Graphs Under Join Operation
• Title not available (Why is that?)
• Additional Closeness and Networks Growth
• Closeness and vertex residual closeness of Harary graphs
• A vulnerability parameter of networks
• Vertex and link residual closeness of graphs of given fractional matching number
• Computational complexity of network vulnerability analysis
• Additional Closeness of Cycle Graphs
• Extremal Results on Vertex and Link Residual Closeness

This page was built for publication: Link vulnerability in networks

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