Block duplicate graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Block duplicate graph''' --- блочно удвоенный граф. A '''block duplicate graph''' ('''BD-graph''') is a graph obtained by adding zero or more…») |
KEV (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Block duplicate graph''' | '''Block duplicate graph''' — ''[[блочно удвоенный граф]].'' | ||
A '''block duplicate graph''' ('''BD-graph''') is a graph obtained by | 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 ''[[cut-vertex]]'', since adding a true | ||
twin to a non-cut vertex preserves the property of being a block | twin to a non-cut vertex preserves the property of being a block | ||
graph). | graph). | ||
==Литература== | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
Версия от 12:08, 20 апреля 2012
Block duplicate graph — блочно удвоенный граф.
A block duplicate graph (BD-graph) is a 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 twin to a non-cut vertex preserves the property of being a block graph).
Литература
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.