strongly connected digraph

strongly connected digraph

[¦strȯŋ·lē kə¦nek·təd ′dī‚graf]
(mathematics)
A directed graph in which there is a directed path from every vertex to every other vertex.
References in periodicals archive ?
Let G = (V, E) be a strongly connected digraph such that the outdegree of each vertex is two.
Definition 2 A directed elimination tree for a nontrivially strongly connected digraph G = (V, E) is a rooted tree T = (T, E) having the following properties:
To establish NP-hardness, we reduce from the problem of determining for a strongly connected digraph G = (E, V) and an integer k whether the cycle rank is at most k, which is NP-hard by Theorem 12.
Let G=(V,E) be a strongly connected digraph in which the out-degree of each vertex is equal to two.
Note also that due to the singularity assumption on paths, even for strongly connected digraphs the intervals [x, y] and [y, x] usually differ from each other.