Balanced digraph

Материал из WikiGrapp
Перейти к:навигация, поиск

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

1. A digraph is balanced, if for every vertex v, deg^{+}(v) =

2. A directed graph is called balanced if each of its cycles contains equal numbers of forward and backward arcs.

3. A directed graph G is balanced if there exists a homomorphism of G to a monotone path.