An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter (Q1396656)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter |
scientific article |
Statements
An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter (English)
0 references
8 July 2003
0 references
