Diameters of cubic graphs (Q1199439): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 05:55, 31 January 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