Chandran, Sunil and Ram, Shankar L (2002) On the Number of Minimum Cuts in a Graph. IISc-CSA-2002-5.
We relate the number of minimum cuts in a weighted undi- rected 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.
|Item Type:||Departmental Technical Report|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||01 Jun 2004|
|Last Modified:||19 Sep 2010 04:12|
Available Versions of this Item
- On the Number of Minimum Cuts in a Graph. (deposited 01 Jun 2004) [Currently Displayed]
Actions (login required)