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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Block duplicate graph''' --- блочно удвоенный граф. A '''block duplicate graph''' ('''BD-graph''') is a graph obtained by adding zero or more…»)
 
Нет описания правки
 
Строка 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 ''[[cutvertex|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.

Текущая версия от 16:31, 23 октября 2018

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.