On large \((\Delta ,D)\)-graphs (Q685678)
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: On large ( ,D)-graphs |
scientific article; zbMATH DE number 423577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On large \((\Delta ,D)\)-graphs |
scientific article; zbMATH DE number 423577 |
Statements
On large \((\Delta ,D)\)-graphs (English)
0 references
24 October 1993
0 references
Constructions of graphs with given maximal degree and diameter and largest possible number of vertices are given. The construction are based on the compound graph technique and expansions of Moore bipartite graphs.
0 references
Moore graph
0 references
maximal degree
0 references
diameter
0 references
0 references
0.9049751162528992
0 references
0.9049751162528992
0 references
0.8848773241043091
0 references
