An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (Q3338283)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter |
scientific article |
Statements
An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (English)
0 references
1984
0 references
communication network
0 references
diameter
0 references
given vertex connectivity
0 references
minimum edges
0 references
