Existence of optimally‐greatest digraphs for strongly connected node reliability

DOI10.1002/net.22150zbMath1529.90038arXiv2206.12248MaRDI QIDQ6139368

Danielle Cox, Kyle MacKeigan, Unnamed Author

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

optimalitypolynomialsdigraphscirculantsnetwork reliabilitystrongly connected

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

• Unnamed Item
• The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
• On Ádám's conjecture for circulant graphs
• On the roots of strongly connected reliability polynomials
• The Complexity of the Residual Node Connectedness Reliability Problem
• Nonexistence of optimal graphs for all terminal reliability
• The strongly connected reliability of complete digraphs

This page was built for publication: Existence of optimally‐greatest digraphs for strongly connected node reliability