An infinite family of 2-connected graphs that have reliability factorisations
From MaRDI portal
(Redirected from Publication:730493)
Recommendations
- On an Invariant of Graphs and the Reliability Polynomial
- Reliabilities of Consecutive-2 Graphs
- A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
- scientific article; zbMATH DE number 3884207
- On the connectivity of infinite graphs and 2-complexes
- Reliabilities for two kinds of graphs with smaller diameters
- Reliability polynomials and their asymptotic limits for families of graphs
- Nonexistence of uniformly most reliable two-terminal graphs
- Infinite family of 2-connected transmission irregular graphs
- On the nonexistence of uniformly optimal graphs for pair-connected reliability
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- Certificates for properties of stability polynomials of graphs
- Certificates of factorisation for a class of triangle-free graphs
- Certificates of factorisation for chromatic polynomials
- Chromatic polynomials of complements of bipartite graphs
- scientific article; zbMATH DE number 4053686 (Why is no real title available?)
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- Non-bipartite chromatic factors
- On dichromatic polynomials
- Tutte-Whitney polynomials: some history and generalizations
Cited in
(2)
This page was built for publication: An infinite family of 2-connected graphs that have reliability factorisations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730493)
