ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On the Number of Minimum Cuts in a Graph

Chandran, Sunil and Ram, Shankar L (2002) On the Number of Minimum Cuts in a Graph. IISc-­CSA-­2002­-5.

WarningThere is a more recent version of this item available.
[img]
Preview
Postscript
chandran-ram-csa-techreport.ps

Download (264Kb)

Abstract

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
URI: http://eprints.iisc.ernet.in/id/eprint/18

Available Versions of this Item

Actions (login required)

View Item View Item