Uniformly optimally reliable graphs
From MaRDI portal
Publication:4540049
DOI<217::AID-NET2>3.0.CO;2-G 10.1002/(SICI)1097-0037(199807)31:4<217::AID-NET2>3.0.CO;2-GzbMath1015.68135OpenAlexW1983669327MaRDI QIDQ4540049
Publication date: 21 July 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199807)31:4<217::aid-net2>3.0.co;2-g
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items (15)
On locally most reliable three-terminal graphs of sparse graphs ⋮ A simple proof of the Gross‐Saccoman multigraph conjecture ⋮ The average reliability of a graph ⋮ 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 ⋮ On the split reliability of graphs ⋮ Uniformly most reliable three-terminal graph of dense graphs ⋮ Optimal domination polynomials ⋮ Network reliability in Hamiltonian graphs ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ A survey of some network reliability analysis and synthesis results ⋮ Uniformly optimal graphs in some classes of graphs with node failures
This page was built for publication: Uniformly optimally reliable graphs
