The structure of max ?-minm?+1 graphs used in the design of reliable networks

DOI10.1002/(SICI)1097-0037(199712)30:4%3C231::AID-NET1%3E3.0.CO;2-KMaRDI QIDQ4369760zbMATH OpenOpenAlexFDO

Authors Guifang Wang, Lianzhu Zhang

Publication date 12 January 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199712)30:4%3C231::aid-net1%3E3.0.co;2-k

zbMATH Keywords

designdistillating graphincidence setnearly independent edge-disconnecting setreliable networks

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Recommendations

• On the construction of most reliable networks
• scientific article; zbMATH DE number 3884207
• A proof of Boesch's conjecture
• Optimally reliable networks

Cited in

(10)

• On the construction of most reliable networks
• The Size of a Minimum Critically m-Neighbor-Scattered Graph
• Optimally restricted edge connected elementary Harary graphs
• scientific article; zbMATH DE number 653272 (Why is no real title available?)
• Characterizations of strength extremal graphs
• Property \(P_{d,m}\) and efficient design of reliable networks
• Uniformly optimally reliable graphs: A survey
• Network reliability: Heading out on the highway
• Nonexistence of uniformly most reliable graphs of least corank
• Most reliable graphs with reduced corank

This page was built for publication: The structure of max ?-minm?+1 graphs used in the design of reliable networks

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