The Klee and Quaife minimum (d, 1, 3)-graphs revisited (Q3866154)

From MaRDI portal
Revision as of 11:48, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Klee and Quaife minimum (d, 1, 3)-graphs revisited
scientific article

    Statements

    The Klee and Quaife minimum (d, 1, 3)-graphs revisited (English)
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    survivable communication network
    0 references
    switching centers
    0 references
    messages
    0 references
    minimum graphs
    0 references
    minimum cubic graphs
    0 references
    diameter
    0 references
    connectivity
    0 references
    associated pseudographs
    0 references
    nonseparable minimum blocks
    0 references
    bridge tree
    0 references
    cut-diameter graph
    0 references
    0 references