Large graphs with given degree and diameter. II (Q793749)
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: Large graphs with given degree and diameter. II |
scientific article; zbMATH DE number 3857149
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large graphs with given degree and diameter. II |
scientific article; zbMATH DE number 3857149 |
Statements
Large graphs with given degree and diameter. II (English)
0 references
1984
0 references
[For part I cf. Ann. Discrete Math. 17, 65-73 (1983; Zbl 0527.05041; for part III cf. Ann. Discrete Math. 13, 23-31 (1982; Zbl 0495.05037).] The (\(\Delta\),D) graph problem consists of finding the maximum number of vertices of a graph with a given maximum degree \(\Delta\) and diameter D. The authors define a new product of graphs concept. Using this they construct graphs of a given maximum degree and diameter having a number of vertices larger than the largest known values.
0 references
interconnection networks
0 references
maximum degree
0 references
diameter
0 references
product of graphs
0 references
0 references
0.96714157
0 references
0.9433502
0 references
0.9366989
0 references
0.93088293
0 references
0.9295079
0 references
0.9133241
0 references
