A note on the link residual closeness of graphs under join operation

DOI10.1142/S0129054119500126MaRDI QIDQ5384124zbMATH OpenOpenAlexWikidataFDO

Authors 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 theorycomplex networksnetwork topologiesvulnerabilitycloseness

Mathematics Subject Classification ID

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

Recommendations

• Link vulnerability in networks
• Extremal Results on Vertex and Link Residual Closeness
• Network robustness and residual closeness
• On combining the methods of link residual and domination in networks
• Residual closeness and generalized closeness

Cites work

• scientific article; zbMATH DE number 4130410 (Why is no real title available?)
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 861347 (Why is no real title available?)
• An algorithm for the computation of edge integrity, \(I^\prime(T)\)
• Computing the Scattering Number of Graphs
• Connectivity and edge-disjoint spanning trees
• Edge‐tenacious networks
• Link vulnerability in networks
• Measuring the vulnerability for classes of intersection graphs
• Network robustness and residual closeness
• On a class of posets and the corresponding comparability graphs
• Recognizing tough graphs is NP-hard
• Rupture degree of graphs
• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• Tough graphs and Hamiltonian circuits.

Cited in

(12)

• Residual closeness in cycles and related networks
• Link vulnerability in networks
• Network robustness and residual closeness
• Node and link vulnerability in complete multipartite networks
• Extremal Results on Vertex and Link Residual Closeness
• Residual closeness and generalized closeness
• Residual closeness of generalized thorn graphs
• Additional Closeness of Cycle Graphs
• On combining the methods of link residual and domination in networks
• Computational complexity of network vulnerability analysis
• Link Residual Closeness of Harary Graphs
• Vertex and link residual closeness of graphs of given fractional matching number

This page was built for publication: A note on the link residual closeness of graphs under join operation

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