A recursive formula for the two‐edge connected and biconnected reliability of a complete graph

DOI10.1002/net.21744zbMath1386.90035OpenAlexW2608511595MaRDI QIDQ4638582

Peter Tittmann, Thomas Lange, Manja Reinwardt

Publication date: 27 April 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21744

zbMATH Keywords

connectivityrandom graphnetwork reliabilityinteger partitionbiconnected graphtwo-edge connected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (1)

Network reliability: Heading out on the highway

This page was built for publication: A recursive formula for the two‐edge connected and biconnected reliability of a complete graph