scientific article; zbMATH DE number 3730180
From MaRDI portal
Publication:3918145
Cited in
(5)- Graphs with small diameter after edge deletion
- The smallest number of edges in a 2-connected graph with specified diameter
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Property \(P_{d,m}\) and efficient design of reliable networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3918145)