The average reliability of a graph

DOI10.1016/J.DAM.2014.05.048zbMATH Open1297.05233OpenAlexW2093687145MaRDI QIDQ406318FDOQ406318

Authors: Jason I. Brown, Richard Ehrenborg, D. Cox 

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.048

Recommendations

• Network reliability
• Some conjectured uniformly optimal reliable networks
• Network reliability in Hamiltonian graphs
• On reliability of graphs with node failures
• scientific article; zbMATH DE number 1444280

zbMATH Keywords

closureall-terminal reliabilityaverage reliabilitycycle bundlesoptimal graph

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Title not available (Why is that?)
• Uniformly-most reliable networks do not always exist
• Chip firing and all-terminal network reliability bounds
• A reliability-improving graph transformation with applications to network reliability
• Uniformly optimally reliable graphs
• Taking Limits under the Integral Sign
• On the existence of uniformly optimally reliable networks

Cited In (7)

• Network reliability in Hamiltonian graphs
• New approximations for network reliability
• More reliable graphs are not always stronger
• Sixty years of network reliability
• Fast reliability ranking of matchstick minimal networks
• Network reliability: Heading out on the highway
• Title not available (Why is that?)

This page was built for publication: The average reliability of a graph

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