Diameters of cubic graphs (Q1199439): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q178140 |
||
| Property / reviewed by | |||
| Property / reviewed by: Jiří Rosický / rank | |||
Revision as of 07:09, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Diameters of cubic graphs |
scientific article |
Statements
Diameters of cubic graphs (English)
0 references
16 January 1993
0 references
It is shown that a graph with maxima degree 3 and diameter \(d\geq 4\) cannot have exactly two vertices less than the Moore bound.
0 references
cubic graphs
0 references
maxima degree
0 references
diameter
0 references
Moore bound
0 references
