Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
418297 | Discrete Applied Mathematics | 2014 | 6 Pages |
Abstract
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 graphs GG and HH, with respective Laplacian matrices L and M, and call HH partially supplied provided that M is a Schur complement of L. Our results show how the minimum cut of HH relates to the structure of the larger graph GG.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Alexander R. Griffing, Benjamin R. Lynch, Eric A. Stone,