On large \((\Delta ,D)\)-graphs (Q685678): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Connections between two cycles --- a new design of dense processor interconnection networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large graphs with given degree and diameter. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Grands Graphes De Degré Et Diamètre Fixés / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4770409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a problem of a. kotzig concerning factorizations of 4‐regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Table of large \(({\Delta{}}, D)\)-graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5184952 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3712354 / rank | |||
Normal rank | |||
Revision as of 09:55, 22 May 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
