Classes of uniformly most reliable graphs for all-terminal reliability

DOI10.1016/j.dam.2019.04.022zbMath1419.05106OpenAlexW2953312349MaRDI QIDQ2322865

Kassie Archer, Christina Graves, David Milan

Publication date: 5 September 2019

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

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

zbMATH Keywords

spanning subgraphsnetwork reliabilityreliability polynomialall-terminal reliability

Mathematics Subject Classification ID

Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items

A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks, Exact reliability optimization for series‐parallel graphs using convex envelopes, Dr. Charles L. Suffel: Scholar, teacher, mentor, friend, 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, More reliable graphs are not always stronger, Uniformly most reliable three-terminal graph of dense graphs, Nonexistence of uniformly most reliable two-terminal graphs

Cites Work

• On the characterization of graphs with maximum number of spanning trees
• SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
• Uniformly-most reliable networks do not always exist
• On unreliability polynomials and graph connectivity in reliable network synthesis
• On graphs with randomly deleted edges
• A proof of Boesch's conjecture
• Nonexistence of optimal graphs for all terminal reliability
• On the existence of uniformly optimally reliable networks