On a reliability polynomial of Fibonacci and some other graphs

zbMATH Open1146.05312MaRDI QIDQ3504606FDOQ3504606

Authors: Mark Korenblit, Vadim E. Levit 

Publication date: 11 June 2008

Recommendations

• scientific article; zbMATH DE number 3947973
• scientific article; zbMATH DE number 3968634
• scientific article; zbMATH DE number 3873364
• scientific article; zbMATH DE number 7260551
• An approximation algorithm for the coefficients of the reliability polynomial

zbMATH Keywords

reliabilityreliability polynomialprobabilistic graphmincutFibonacci graphoperating pathcoefficients of reliability polynomialsize of mincutst-connectednessst-dag

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Paths and cycles (05C38) Stochastic network models in operations research (90B15)

Cited In (3)

• Mincuts in generalized Fibonacci graphs of degree 3
• A recurrence formula for unreliability polynomial of graphs
• Title not available (Why is that?)

This page was built for publication: On a reliability polynomial of Fibonacci and some other graphs

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