scientific article; zbMATH DE number 913349

DOI10.1002/(SICI)1097-0037(199603)27:2%3C125::AID-NET4%3E3.0.CO;2-MMaRDI QIDQ4887741zbMATH OpenFDO

Authors John T. Saccoman, Laura Schoppmann, L. Petingi

Publication date 5 August 1996

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199603)27:2%3C125::AID-NET4%3E3.0.CO;2-M

zbMATH Keywords

undirected graphall-terminal reliability

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Uniformly least reliable graphs in class (n,e) as e n+1.
• Classes of uniformly most reliable graphs for all-terminal reliability
• Some conjectured uniformly optimal reliable networks
• On reliability of graphs with node failures
• Nonexistence of uniformly most reliable two-terminal graphs

Cited in

(9)

• Uniformly least reliable graphs in class (n,e) as e n+1.
• Invulnerability of planar two-tree networks
• Classes of uniformly most reliable graphs for all-terminal reliability
• Characterization of locally most split reliable graphs
• Uniformly optimal graphs in some classes of graphs with node failures
• Heuristic maximization of the number of spanning trees in regular graphs
• Uniformly optimally reliable graphs: A survey
• Laplacian eigenvalues of special cases of L-graphs
• Network reliability: Heading out on the highway

This page was built for publication:

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