Coalescing of two rooted graphs: различия между версиями

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

A '''coalescing of two rooted graphs''' <math>\,(G,u)</math> and <math>\,(H,v)</math>, denoted

<math>\,G.H</math>, is defined by Schwenk as a [[graph, undirected graph, nonoriented graph|graph]] obtained by identifying the two [[root|roots]] so that <math>\,u=v</math> becomes a ''[[cut-vertex]]'' of <math>\,G.H</math>.

 

 

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