Аноним

Cotree, co-tree: различия между версиями

Материал из WEGA
нет описания правки
(Новая страница: «'''Cotree, co-tree''' --- кодерево (графа). Let <math>T</math> be a ''spanning tree'' of <math>G</math>. A '''cotree''' of <math>G</math> is a graph i…»)
 
Нет описания правки
Строка 1: Строка 1:
'''Cotree, co-tree''' --- кодерево (графа).  
'''Cotree, co-tree''' — ''[[кодерево|кодерево (графа)]].''


Let <math>T</math> be a ''spanning tree'' of <math>G</math>. A '''cotree''' of <math>G</math> is a
Let <math>\,T</math> be a ''[[spanning tree]]'' of <math>\,G</math>. A '''cotree''' of <math>\,G</math> is a [[graph, undirected graph, nonoriented graph|graph]] induced by [[edge|edges]] that do not belong to <math>T</math>. Any edge of a cotree
graph induced by edges that do not belong to <math>T</math>. Any edge of a cotree
is called a ''[[chord]]'' of the spanning-tree.
is called a ''chord'' of the spanning-tree.
 
==Литература==
 
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.