The superconnectivity of large digraphs and graphs (Q1313826)

From MaRDI portal
Revision as of 11:57, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The superconnectivity of large digraphs and graphs
scientific article

    Statements

    The superconnectivity of large digraphs and graphs (English)
    0 references
    0 references
    1 March 1994
    0 references
    First of all the author gives basic notions and an overview of actual results. The digraph \(D\) is said to be super-\(\kappa\) (vertex connectivity) if all its minimum disconnecting sets are trivial. Analogously, \(D\) is called super-\(\lambda\) (edge connectivity) if all its minimum edge-disconnecting sets are trivial. The author's main results are sufficient conditions for a digraph \(D\) to be super-\(\kappa\) or super-\(\lambda\). Moreover, the author gives several interesting corollaries of these theorems.
    0 references
    superconnectivity
    0 references
    vertex connectivity
    0 references
    edge connectivity
    0 references
    digraph
    0 references

    Identifiers