Structural properties of the minimum cut of partially-supplied graphs.
It is well known that information about the structure of a graph is contained within its minimum cut. Here we investigate how the minimum cut of one graph informs the structure of a second, related graph. We consider pairs of graphsGandH, with respective Laplacian matrices L and M, and callHpartially supplied provided M is a Schur complement of L. Our results show how the minimum cut ofHrelates to the structure of the larger graphG.
Bioinformatics Research Center, North Carolina State University, Raleigh, NC 27695-7566, USA.
Alexander R
AR
Griffing
Bioinformatics Research Center, North Carolina State University, Raleigh, NC 27695-7566, USA.
Benjamin R
BR
Lynch
Bioinformatics Research Center, North Carolina State University, Raleigh, NC 27695-7566, USA ; Department of Biological Sciences, North Carolina State University, Raleigh, NC 27695-7614, USA.
Eric A
EA
Stone