Просмотр кода страницы Balanced digraph

'''Balanced digraph''' — ''[[сбалансированный орграф]].'' 

'''1.''' A [[digraph]] is '''balanced''', if for every [[vertex]] <math>v</math>, <math>deg^{+}(v) =
deg^{-}(v)</math>.

'''2.''' A [[directed graph]] is called '''balanced''' if each of its [[cycle|cycles]]
contains equal numbers of [[forward arc|forward]] and [[backward arc|backward arcs]].

'''3.''' A directed graph <math>G</math> is '''balanced''' if there exists a ''[[homomorphism of a graph|homomorphism]]'' of <math>G</math> to a monotone [[path]].