Block duplicate graph

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.