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.
|Number of pages||7|
|Journal||Electronic Notes in Discrete Mathematics|
|State||Published - 15 Jul 2006|
- directed acyclic graph
- series-parallel graph