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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Coalescing of two rooted graphs''' --- срастание двух корневых графов. A '''coalescing of two rooted graphs''' <math>(G,u)</math> and…»)
 
Нет описания правки
 
Строка 1: Строка 1:
'''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
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 obtained by identifying the
<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>.
two roots so that <math>u=v</math> becomes a ''cut-vertex'' of <math>G.H</math>.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.

Текущая версия от 10:46, 24 октября 2018

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

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

Литература

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