Block duplicate graph: различия между версиями

Block duplicate graph (посмотреть исходный код)

10 байт добавлено , 20 апреля 2012

нет описания правки

4624

правки

@@ Строка 2: / Строка 2: @@
 A '''block duplicate graph''' ('''BD-graph''') is a [[graph, undirected graph, nonoriented graph|graph]] obtained by
-adding zero or more ''[[true twins]]'' to each [[vertex]] of a ''[[block graph]]'' (or equivalently to each ''[[cut-vertex]]'', since adding a true
+adding zero or more ''[[true twins]]'' to each [[vertex]] of a ''[[block graph]]'' (or equivalently to each ''[[cutvertex|cut-vertex]]'', since adding a true
 twin to a non-cut vertex preserves the property of being a block
 graph).