Graphs with the smallest number of minimum cut sets

DOI10.1002/NET.3230140105zbMATH Open0552.05036OpenAlexW1993785174MaRDI QIDQ3344017FDOQ3344017

Authors:

Publication date: 1984

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• Graphs with largest number of minimum cuts
• Number of minimum vertex cuts in transitive graphs
• An exact lower bound on the number of cut‐sets in multigraphs
• Optimal graphs with prescribed connectivities
• The connected cutset connectivity of a graph

zbMATH Keywords

regular graphnetwork reliabilityvertex cut sets

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• An exact lower bound on the number of cut‐sets in multigraphs
• Minimum cut with the fewest number of arcs
• Minimum weight resolving sets of grid graphs
• On the Number of Minimum Cuts in a Graph
• Cutsets in perfect and minimal imperfect graphs
• Number of minimum vertex cuts in transitive graphs
• Title not available (Why is that?)
• Minimal graph cuts on network subgraphs
• Counting the number of minimum cuts in undirected multigraphs
• Super edge-connectivity of dense digraphs and graphs
• Optimally Reliable Graphs for Both Vertex and Edge Failures
• Superconnectivity for minimal multi-loop networks
• Title not available (Why is that?)
• Minimal 2-connected graphs satisfying the even cut condition
• Solution methods for the vertex variant of the network system vulnerability analysis problem
• From connectivity to coloring
• Title not available (Why is that?)
• Minimum Cuts in Surface Graphs
• Optimally reliable networks
• Smallest Graphs Achieving the Stinson Bound
• On the number of small cut in a graph

This page was built for publication: Graphs with the smallest number of minimum cut sets

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