Nonexistence of optimal graphs for all terminal reliability

DOI10.1002/NET.21530MaRDI QIDQ4639690zbMATH OpenOpenAlexFDO

Authors Jason I. Brown, D. Cox

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

all terminaloptimalreliabilitysemiregular graph

Mathematics Subject Classification ID

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

Recommendations

• Nonexistence of uniformly most reliable two-terminal graphs
• Some conjectured uniformly optimal reliable networks
• On the existence of uniformly optimally reliable networks
• Uniformly optimal digraphs for strongly connected reliability
• A proof of Boesch's conjecture

Cited in

(24)

• Optimal graphs for independence and \(k\)-independence polynomials
• On locally most reliable three-terminal graphs of sparse graphs
• Optimal domination polynomials
• Nonexistence of uniformly most reliable two-terminal graphs
• Classes of uniformly most reliable graphs for all-terminal reliability
• Uniformly optimal digraphs for strongly connected reliability
• scientific article; zbMATH DE number 2077669 (Why is no real title available?)
• 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
• On the construction of locally most reliable two-terminal graphs
• On a conjecture of regular graphs having the minimum number of induced paths of length two
• Nonexistence of uniformly most reliable graphs of least corank
• Most reliable graphs with reduced corank
• There are finitely many uniformly most reliable graphs of corank 5
• On bipartite graphs with the minimum number of spanning trees

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

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