On large \((\Delta ,D)\)-graphs (Q685678): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90368-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060475722 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On large \((\Delta ,D)\)-graphs |
scientific article |
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
