Graphs with the smallest number of minimum cut sets
From MaRDI portal
Publication:3344017
DOI10.1002/net.3230140105zbMath0552.05036OpenAlexW1993785174MaRDI QIDQ3344017
No author found.
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140105
Related Items (5)
Optimally Reliable Graphs for Both Vertex and Edge Failures ⋮ Superconnectivity for minimal multi-loop networks ⋮ Optimally reliable networks ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem
Cites Work
This page was built for publication: Graphs with the smallest number of minimum cut sets
