Nonexistence of optimal graphs for all terminal reliability

DOI10.1002/net.21530zbMath1386.05188OpenAlexW2039700046MaRDI QIDQ4639690

Danielle Cox, Jason I. Brown

Publication date: 11 May 2018

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

reliabilityoptimalsemiregular graphall terminal

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Graph theory (05C99)

Related Items (16)

On locally most reliable three-terminal graphs of sparse graphs ⋮ On maximum graphs in Tutte polynomial posets ⋮ Fast reliability ranking of matchstick minimal networks ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ The <scp>Gross–Saccoman</scp> conjecture is true ⋮ <scp>M</scp>ost reliable two‐terminal graphs with node failures ⋮ Rational roots of all‐terminal reliability ⋮ Existence of optimally‐greatest digraphs for strongly connected node reliability ⋮ On the split reliability of graphs ⋮ More reliable graphs are not always stronger ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Optimal domination polynomials ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ Classes of uniformly most reliable graphs for all-terminal reliability

This page was built for publication: Nonexistence of optimal graphs for all terminal reliability