Diameters of cubic graphs (Q1199439): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Jiří Rosický / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jiří Rosický / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)90144-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042238621 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
Diameters of cubic graphs
scientific article

    Statements

    Diameters of cubic graphs (English)
    0 references
    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

    Identifiers