The strongly connected reliability of complete digraphs
From MaRDI portal
Publication:4680417
DOI10.1002/NET.20060zbMath1062.05081OpenAlexW4248853006MaRDI QIDQ4680417
Publication date: 1 June 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20060
Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (4)
Network reliability: Heading out on the highway ⋮ Existence of optimally‐greatest digraphs for strongly connected node reliability ⋮ On the roots of strongly connected reliability polynomials ⋮ The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
This page was built for publication: The strongly connected reliability of complete digraphs
