Structural properties of the minimum cut of partially-supplied graphs

DOI10.1016/J.DAM.2014.05.043zbMATH Open1300.05160OpenAlexW2093789529WikidataQ43001147 ScholiaQ43001147MaRDI QIDQ406340FDOQ406340

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

Recommendations

• scientific article; zbMATH DE number 2089977
• An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
• On the Number of Minimum Cuts in a Graph
• Minimal graph cuts on network subgraphs
• On the structure of vertex cuts separating the ends of a graph

zbMATH Keywords

minimum cuttree reconstruction

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Multi-Terminal Network Flows
• NOTE ON M-MATRICES
• An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
• Applications of M-matrices to non-negative matrices
• Title not available (Why is that?)
• On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian

Cited In (3)

• Spectra of power hypergraphs and signed graphs via parity-closed walks
• The enumeration of spanning tree of weighted graphs
• Counting spanning trees of \((1, N\))-periodic graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406340)