Coalescing of two rooted graphs

Материал из WikiGrapp
Перейти к:навигация, поиск

Coalescing of two rooted graphsсрастание двух корневых графов.

A coalescing of two rooted graphs \,(G,u) and \,(H,v), denoted \,G.H, is defined by Schwenk as a graph obtained by identifying the two roots so that \,u=v becomes a cut-vertex of \,G.H.


  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.