A recurrence formula for unreliability polynomial of graphs

MaRDI QIDQ3052567zbMATH OpenFDO

Authors Wei Xiong, Zhao Zhang

Publication date 5 November 2010

zbMATH Keywords

recurrence formulaunreliability polynomial

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 3947973
• scientific article; zbMATH DE number 1218897
• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• Reliability polynomials and their asymptotic limits for families of graphs
• On a reliability polynomial of Fibonacci and some other graphs

Cited in

(4)

• Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
• A recursive formula for the reliability of a r-uniform complete hypergraph and its applications
• scientific article; zbMATH DE number 3985282 (Why is no real title available?)
• scientific article; zbMATH DE number 1218897 (Why is no real title available?)

This page was built for publication: A recurrence formula for unreliability polynomial of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3052567)