Residual closeness in cycles and related networks
From MaRDI portal
Publication:2841952
DOI10.3233/FI-2013-835zbMATH Open1311.68017OpenAlexW1635237076MaRDI QIDQ2841952FDOQ2841952
Authors: Zeynep Nihan Odabaş, Aysun Aytaç 
Publication date: 30 July 2013
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2013-835
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cited In (19)
- Node and link vulnerability in complete multipartite networks
- Network robustness and residual closeness
- Computing closeness for some graphs
- On the residual closeness of graphs with cut vertices
- Closeness and vertex residual closeness of Harary graphs
- Title not available (Why is that?)
- Residual closeness of wheels and related networks
- Link vulnerability in networks
- Exponential independence number of some graphs
- The vulnerability of some networks including cycles via domination parameters
- Vertex and link residual closeness of graphs of given fractional matching number
- Robustness of regular caterpillars
- Inducing Measures by Cyclic Networks
- Additional closeness and networks growth
- Additional Closeness of Cycle Graphs
- Extremal Results on Vertex and Link Residual Closeness
- Structural vulnerability and robustness in complex networks: different approaches and relationships between them
- Link Residual Closeness of Harary Graphs
- Residual closeness of graphs with given parameters
This page was built for publication: Residual closeness in cycles and related networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841952)
