weakly connected digraph

weakly connected digraph

[¦wēk·lē kə‚nek·təd ′dī‚graf]
(mathematics)
A directed graph whose underlying graph is a connected graph.
References in periodicals archive ?
A rooted tree is a weakly connected digraph with one vertex which has out-degree 0, while all other vertices have out-degree 1.
1 If a strongly connected automaton A = <Q, [summation], [delta]> respects the intervals of an scc-dense weakly connected digraph D on Q, then A satisfies the Cerny conjecture.
2 Let D be a weakly connected digraph on Q with unique return paths.