Uniformly optimally reliable graphs

DOI10.1002/(SICI)1097-0037(199807)31:4%3C217::AID-NET2%3E3.0.CO;2-GMaRDI QIDQ4540049zbMATH OpenOpenAlexFDO

Authors John T. Saccoman, Daniel J. Gross

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199807)31:4%3C217::aid-net2%3E3.0.co;2-g

zbMATH Keywords

multigraphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Some conjectured uniformly optimal reliable networks
• On component order edge reliability and uniform optimality
• Uniformly optimal graphs in some classes of graphs with node failures
• Uniformly least reliable graphs in class (n,e) as e n+1.
• scientific article; zbMATH DE number 1444280

Cited in

(25)

• Uniformly optimal graphs in some classes of graphs with node failures
• The optimal unicyclic graphs for pair-connected reliability
• On reliable graphs with static routing plans
• Optimal graphs for independence and \(k\)-independence polynomials
• On locally most reliable three-terminal graphs of sparse graphs
• Optimal domination polynomials
• Network reliability in Hamiltonian graphs
• Nonexistence of uniformly most reliable two-terminal graphs
• Classes of uniformly most reliable graphs for all-terminal reliability
• Uniform resource networks. I: Complete graphs
• Some conjectured uniformly optimal reliable networks
• Counterexamples to conjectures for uniformly optimally reliable graphs.
• On component order edge reliability and uniform optimality
• A survey of some network reliability analysis and synthesis results
• Uncoverings on graphs and network reliability
• The average reliability of a graph
• Study on the uniformly optimally reliable graphs for given classes of graph
• scientific article; zbMATH DE number 5031207 (Why is no real title available?)
• A simple proof of the Gross‐Saccoman multigraph conjecture
• 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

This page was built for publication: Uniformly optimally reliable graphs

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