On the Number of Minimum Cuts in a Graph

Authors:
L. Sunil Chandran;L. Shankar Ram
Affiliations:
-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 8
Cited 1

A matroid approach to finding edge connectivity and packing arborescences

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Graphs with largest number of minimum cuts

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
On the number of small cuts in a graph

Information Processing Letters
Computing All Small Cuts in an Undirected Network

SIAM Journal on Discrete Mathematics
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time

Journal of Algorithms
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Extremal Graph Theory

Extremal Graph Theory

Mincuts in generalized Fibonacci graphs of degree 3

Journal of Computational Methods in Sciences and Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We relate the number of minimum cuts in a weighted undirected graph with various structural parameters of the graph. In particular, we upper-bound the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, expansion, girth etc. of the graph.