Diameters of cubic graphs (Q1199439): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Regular graphs with excess one / 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: Q4770409 / rank | |||
Normal rank | |||
Revision as of 15:16, 16 May 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
