Outpath: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Outpath''' --- выходящий путь. An ''' outpath''' of a vertex <math>x</math> (an arc <math>(x,y)</math>, respectively) in a digraph is a path starti…»)
 
Нет описания правки
 
Строка 4: Строка 4:
digraph is a path starting at <math>x</math> (<math>(x,y)</math>, respectively) such that
digraph is a path starting at <math>x</math> (<math>(x,y)</math>, respectively) such that
<math>x</math> dominates the endvertex of a path only if the endvertex also
<math>x</math> dominates the endvertex of a path only if the endvertex also
dominates <math>x</math>. An outpath of length <math>k</math> is called a '''<math>k-</math>outpath'''.
dominates <math>x</math>. An outpath of length <math>k</math> is called a '''<math>k</math>-outpath'''.

Текущая версия от 16:41, 7 июня 2011

Outpath --- выходящий путь.

An outpath of a vertex [math]\displaystyle{ x }[/math] (an arc [math]\displaystyle{ (x,y) }[/math], respectively) in a digraph is a path starting at [math]\displaystyle{ x }[/math] ([math]\displaystyle{ (x,y) }[/math], respectively) such that [math]\displaystyle{ x }[/math] dominates the endvertex of a path only if the endvertex also dominates [math]\displaystyle{ x }[/math]. An outpath of length [math]\displaystyle{ k }[/math] is called a [math]\displaystyle{ k }[/math]-outpath.