scientific article
From MaRDI portal
Publication:3918145
zbMath0466.05046MaRDI QIDQ3918145
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40)
Related Items (5)
On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ The smallest number of edges in a 2-connected graph with specified diameter ⋮ Property Pd,m and efficient design of reliable networks ⋮ Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra ⋮ Graphs with small diameter after edge deletion
This page was built for publication:
