| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653126 | Electronic Notes in Discrete Mathematics | 2006 | 7 Pages |
Abstract
We define a two-terminal directed acyclic graph (st-dag) characterized by a special structure of its mincuts and call it a nested graph. It is proved that every nested graph is series-parallel as well. We show that an st-dag of order n has exactly n−1 mincuts if and only if it is nested.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
