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

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199712)30:4<231::AID-NET1>3.0.CO;2-K" /><231::AID-NET1>3.0.CO;2-K 10.1002/(SICI)1097-0037(199712)30:4<231::AID-NET1>3.0.CO;2-KzbMath0893.90169OpenAlexW2029930188MaRDI QIDQ4369760

Guifang Wang, Lian Zhu Zhang

Publication date: 12 January 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199712)30:4<231::aid-net1>3.0.co;2-k

zbMATH Keywords

designincidence setreliable networksdistillating graphnearly independent edge-disconnecting set

Mathematics Subject Classification ID

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

Related Items (4)

Optimally restricted edge connected elementary Harary graphs ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ On the construction of most reliable networks

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