On the split reliability of graphs

DOI10.1002/net.22166zbMath1529.90033arXiv2306.03884OpenAlexW4381434719MaRDI QIDQ6139376

Unnamed Author, Jason I. Brown

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.03884

zbMATH Keywords

graphoptimalall-terminal reliabilitytwo-terminal reliabilitysplit reliability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• On the roots of all-terminal reliability polynomials
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Uniformly optimally reliable graphs
• Nonexistence of optimal graphs for all terminal reliability

This page was built for publication: On the split reliability of graphs