Discrete Mathematics : Directed Graphs

This section helps you to learn about ** Directed Graph** in details with given suitable examples.

**Directed Graph: ** A graph is called the **Directed Graph **if in a graph the set of vertices are V and the set of edges is E, consists the order pairs of elements of V. Generally we can say that each **pair of vertices** are connected by a **straight lines** or a direction between both the vertices are given.

**Example: **The graph with the vertices are {v_{1}, v_{2}, v_{3}} and its edges are {e_{1}, e_{2}, e_{3}}). The shape of a graph is a triangular shape. The graph is shown below.

**Example**: A graph has 4 vertices v_{1}, v_{2}, v_{3} and v_{4} with its edges are e_{1}, e_{2}, e_{3} and e_{4} and the shape of graph is a rectangular shape. A graph
G = (V, E) = ({v_{1}, v_{2}, v_{3}, v_{4}), {e_{1}, e_{2}, e_{3}, e_{4}) will be drawn as