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 the normal view instead:
scientific article; zbMATH DE number 1947221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.846569836139679
0 references
0.8432803750038147
0 references
0.8070339560508728
0 references
