Recommendations
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 194437 (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^(T)
- Computing the Scattering Number of Graphs
- Connectivity and edge-disjoint spanning trees
- Edge‐tenacious networks
- Measuring the vulnerability for classes of intersection graphs
- Multiscale vulnerability of complex networks
- Network robustness and residual closeness
- On a class of posets and the corresponding comparability graphs
- Recognizing tough graphs is NP-hard
- Residual closeness and generalized closeness
- Residual closeness in cycles and related networks
- Residual closeness of wheels and related networks
- Rupture degree of graphs
- Tenacity and rupture degree of permutation graphs of complete bipartite graphs
- Tough graphs and Hamiltonian circuits.
Cited in
(21)- Link Residual Closeness of Harary Graphs
- Node and link vulnerability in complete multipartite networks
- scientific article; zbMATH DE number 1735721 (Why is no real title available?)
- Network robustness and residual closeness
- On combining the methods of link residual and domination in networks
- Residual closeness and generalized closeness
- Closeness and vertex residual closeness of Harary graphs
- Determining vulnerability of central networks using closeness and Nordhaus-Gaddum type relation
- Residual closeness of wheels and related networks
- A note on the link residual closeness of graphs under join operation
- On vulnerability measures of networks
- A vulnerability parameter of networks
- Bound and exact methods for assessing link vulnerability in complex networks
- Vertex and link residual closeness of graphs of given fractional matching number
- Computational complexity of network vulnerability analysis
- Additional closeness and networks growth
- Residual closeness for helm and sunflower graphs
- Vulnerability of Mycielski graphs via residual closeness.
- Residual closeness in cycles and related networks
- Additional Closeness of Cycle Graphs
- Extremal Results on Vertex and Link Residual Closeness
This page was built for publication: Link vulnerability in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640344)
