Structural properties of the minimum cut of partially-supplied graphs

DOI10.1016/j.dam.2014.05.043zbMath1300.05160OpenAlexW2093789529WikidataQ43001147 ScholiaQ43001147MaRDI QIDQ406340

Benjamin R. Lynch, Eric A. Stone, Alexander R. Griffing

Publication date: 8 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.043

zbMATH Keywords

minimum cuttree reconstruction

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Counting spanning trees of \((1, N\))-periodic graphs ⋮ The enumeration of spanning tree of weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian
• An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
• Applications of M-matrices to non-negative matrices
• NOTE ON M-MATRICES
• Multi-Terminal Network Flows

This page was built for publication: Structural properties of the minimum cut of partially-supplied graphs