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

Материал из WikiGrapp
Перейти к:навигация, поиск
 
Строка 2: Строка 2:
  
 
A '''block duplicate graph''' ('''BD-graph''') is a [[graph, undirected graph, nonoriented graph|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).

Текущая версия на 12:26, 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.