An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter (Q1396656): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:00, 31 January 2024
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