On the Number of Minimum Cuts in a Graph

Authors:
L. Sunil Chandran;L. Shankar Ram
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2005

Citing 0
Cited 3

An analysis of graph cut size for transductive learning

ICML '06 Proceedings of the 23rd international conference on Machine learning
Note: An improved algorithm for the longest induced path problem on k-chordal graphs

Discrete Applied Mathematics
Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We relate the number of minimum cuts in a weighted undirected graph with various structural parameters of the graph. In particular, we provide upper bounds for the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, girth, and some other parameters of the graph.