Residual closeness in cycles and related networks
From MaRDI portal
Publication:2841952
Recommendations
Cited in
(19)- Link Residual Closeness of Harary Graphs
- Residual closeness of graphs with given parameters
- 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
- scientific article; zbMATH DE number 6770087 (Why is no real title available?)
- 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
- Robustness of regular caterpillars
- Vertex and link residual closeness of graphs of given fractional matching number
- 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
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)