An infinite family of 2-connected graphs that have reliability factorisations (Q730493)

From MaRDI portal
Revision as of 04:58, 13 July 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
An infinite family of 2-connected graphs that have reliability factorisations
scientific article

    Statements

    An infinite family of 2-connected graphs that have reliability factorisations (English)
    0 references
    0 references
    0 references
    28 December 2016
    0 references
    network reliability
    0 references
    reliability polynomial
    0 references
    chromatic polynomial
    0 references
    Tutte polynomial
    0 references

    Identifiers