# Directed Tree Graph

Jump to navigation
Jump to search

A Directed Tree Graph is a tree graph that is a Directed Graph.

**Context:**- It must have a Graph Node with no Graph Leafs.
- …

**Counter-Example(s):****See:**Ordered Tree, Rooted Tree.

## References

### 2010

- http://en.wikipedia.org/w/index.php?title=Tree_%28graph_theory%29&action=edit
- A
**directed tree**is a directed graph which would be a tree if the directions on the edges were ignored. Some authors restrict the phrase to the case where the edges are all directed towards a particular vertex, or all directed away from a particular vertex (see arborescence).

- A