Title of article
Nested Graphs
Author/Authors
Korenblit، نويسنده , , Mark and Levit، نويسنده , , Vadim E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
7
From page
93
To page
99
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.
Keywords
Mincut , series-parallel graph , Directed acyclic graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454271
Link To Document