A Note on the Link Residual Closeness of Graphs Under Join Operation

DOI10.1142/S0129054119500126zbMath1415.68161OpenAlexW2942967760WikidataQ127957896 ScholiaQ127957896MaRDI QIDQ5384124

Esin Yigit, Zeynep Nihan Odabaş Berberler

Publication date: 21 June 2019

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

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

zbMATH Keywords

graph theoryvulnerabilitycomplex networksnetwork topologiescloseness

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

Extremal Results on Vertex and Link Residual Closeness ⋮ Link Residual Closeness of Harary Graphs ⋮ Computational complexity of network vulnerability analysis ⋮ Additional Closeness of Cycle Graphs

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.
• Network robustness and residual closeness
• Link Vulnerability in Networks
• Edge‐tenacious networks
• Computing the Scattering Number of Graphs
• Rupture degree of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Note on the Link Residual Closeness of Graphs Under Join Operation