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

From MaRDI portal
Revision as of 10:19, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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