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

DOI10.1016/J.DAM.2016.11.006zbMath1352.05100OpenAlexW2559822349MaRDI QIDQ730493

Kerri Morgan, Rui Chen

Publication date: 28 December 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.006

zbMATH Keywords

chromatic polynomialTutte polynomialnetwork reliabilityreliability polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Reliability, availability, maintenance, inspection in operations research (90B25) Connectivity (05C40)

Cites Work

• Certificates for properties of stability polynomials of graphs
• Non-bipartite chromatic factors
• Chromatic polynomials of complements of bipartite graphs
• Certificates of factorisation for chromatic polynomials
• Certificates of factorisation for a class of triangle-free graphs
• On dichromatic polynomials
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An infinite family of 2-connected graphs that have reliability factorisations