An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter (Q1396656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter |
scientific article; zbMATH DE number 1947221
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter |
scientific article; zbMATH DE number 1947221 |
Statements
An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter (English)
0 references
8 July 2003
0 references
