Residual closeness of wheels and related networks
From MaRDI portal
Publication:3173947
DOI10.1142/S0129054111008660zbMATH Open1226.68069OpenAlexW2100010234MaRDI QIDQ3173947FDOQ3173947
Authors: Zeynep Nihan Odabaş, Aysun Aytaç
Publication date: 10 October 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111008660
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)
Cites Work
Cited In (21)
- Node and link vulnerability in complete multipartite networks
- Residual closeness of generalized thorn graphs
- Network robustness and residual closeness
- Computing closeness for some graphs
- Residual closeness and generalized closeness
- On the residual closeness of graphs with cut vertices
- Closeness and vertex residual closeness of Harary graphs
- Title not available (Why is that?)
- Link vulnerability in networks
- Exponential independence number of some graphs
- Vertex and link residual closeness of graphs of given fractional matching number
- Robustness of regular caterpillars
- The 2-extra connectivity of wheel networks
- Additional closeness and networks growth
- Residual closeness for helm and sunflower graphs
- Additional Closeness of Cycle Graphs
- Vulnerability of Mycielski graphs via residual closeness.
- Residual closeness in cycles and related networks
- Extremal Results on Vertex and Link Residual Closeness
- Link Residual Closeness of Harary Graphs
- Residual closeness of graphs with given parameters
This page was built for publication: Residual closeness of wheels and related networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173947)