A note on the link residual closeness of graphs under join operation
DOI10.1142/S0129054119500126zbMATH Open1415.68161OpenAlexW2942967760WikidataQ127957896 ScholiaQ127957896MaRDI QIDQ5384124FDOQ5384124
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
Recommendations
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)
Cites Work
- Edge‐tenacious networks
- 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
- Tenacity and rupture degree of permutation graphs of complete bipartite graphs
- Computing the Scattering Number of Graphs
- Link vulnerability in networks
- An algorithm for the computation of edge integrity, \(I^\prime(T)\)
- Network robustness and residual closeness
Cited In (12)
- Node and link vulnerability in complete multipartite networks
- Residual closeness of generalized thorn graphs
- Network robustness and residual closeness
- On combining the methods of link residual and domination in networks
- Residual closeness and generalized closeness
- Link vulnerability in networks
- Vertex and link residual closeness of graphs of given fractional matching number
- Computational complexity of network vulnerability analysis
- Additional Closeness of Cycle Graphs
- Residual closeness in cycles and related networks
- Extremal Results on Vertex and Link Residual Closeness
- Link Residual Closeness of Harary Graphs
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)