An infinite family of 2-connected graphs that have reliability factorisations (Q730493): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:05, 5 March 2024

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