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.
Corollary 4.2 Let D be a weakly connected digraph on Q with unique return paths.
We will consider both strongly connected digraphs (where for each pair of vertices x, y there exists a directed path from x to y) and weakly connected digraphs (where each pair of vertices is connected by some undirected path) (that is the underlying undirected graph is connected).