Splitting formulas for computing connectedness probability of undirected graphs

DOI10.1080/02331939008843545MaRDI QIDQ3483062zbMATH OpenOpenAlexFDO

Authors Eckhard Manthei

Publication date 1990

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939008843545

zbMATH Keywords

connected undirected graphsconnectedness probabilitysplitting formulaTutte polynomial

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4097432
• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• Computing residual connectedness reliability for restricted networks
• scientific article; zbMATH DE number 4091558
• IEEE Trans. Reliab.,

Cited in

(1)

• scientific article; zbMATH DE number 4097432 (Why is no real title available?)

This page was built for publication: Splitting formulas for computing connectedness probability of undirected graphs

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