Skip to main content
Conference Proceedings

On the number of minimum cuts in a graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2387 220-229
DOI: 10.1007/3-540-45655-4_25
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Chandran, L. S., & Ram, L. S. (2002). On the number of minimum cuts in a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 220–229). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free