The minimum order of n-connected n-regular graphs with specified diameters (Q3701449)
From MaRDI portal
!
WARNING
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 3926950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum order of n-connected n-regular graphs with specified diameters |
scientific article; zbMATH DE number 3926950 |
Statements
The minimum order of n-connected n-regular graphs with specified diameters (English)
0 references
1985
0 references
minimum graph
0 references
regular graph
0 references
diameter
0 references
connectivity
0 references
0.8545746207237244
0 references
0.78413987159729
0 references
0.7761573195457458
0 references
0.7748321890830994
0 references
0.774085283279419
0 references
