On the design of reliable networks

DOI10.1002/NET.3230030304zbMATH Open0272.05124OpenAlexW2068484326MaRDI QIDQ3214962FDOQ3214962

Authors: S. Louis Hakimi, Ashok T. Amin 

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030304

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)

Cited In (6)

• Number of minimum vertex cuts in transitive graphs
• Heuristic maximization of the number of spanning trees in regular graphs
• Super edge-connectivity of dense digraphs and graphs
• Optimally Reliable Graphs for Both Vertex and Edge Failures
• Optimally reliable networks
• Network reliability: Heading out on the highway

This page was built for publication: On the design of reliable networks

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