Nested Graphs

Mark Korenblit; Vadim E. Levit

doi:10.1016/j.endm.2006.06.016

Nested Graphs

Mark Korenblit
, Vadim E. Levit

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	93-99
Number of pages	7
Journal	Electronic Notes in Discrete Mathematics
Volume	24
DOIs	https://doi.org/10.1016/j.endm.2006.06.016
State	Published - 15 Jul 2006
Externally published	Yes

Keywords

Mincut
directed acyclic graph
series-parallel graph

Access to Document

10.1016/j.endm.2006.06.016

Cite this

@article{199778c06add47c1974b90ae4336e10d,

title = "Nested Graphs",

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, directed acyclic graph, series-parallel graph",

author = "Mark Korenblit and Levit, \{Vadim E.\}",

year = "2006",

month = jul,

day = "15",

doi = "10.1016/j.endm.2006.06.016",

language = "אנגלית",

volume = "24",

pages = "93--99",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - Nested Graphs

AU - Korenblit, Mark

AU - Levit, Vadim E.

PY - 2006/7/15

Y1 - 2006/7/15

N2 - 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.

AB - 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.

KW - Mincut

KW - directed acyclic graph

KW - series-parallel graph

UR - https://www.scopus.com/pages/publications/33745867972

U2 - 10.1016/j.endm.2006.06.016

DO - 10.1016/j.endm.2006.06.016

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33745867972

SN - 1571-0653

VL - 24

SP - 93

EP - 99

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Nested Graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this