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 {v1, v2, v3} and its edges are {e1, e2, e3}). The shape of a graph is a triangular shape. The graph is shown below.

Directed Graph

Example: A graph has 4 vertices v1, v2, v3 and v4 with its edges are e1, e2, e3 and e4 and the shape of graph is a rectangular shape. A graph G = (V, E) = ({v1, v2, v3, v4), {e1, e2, e3, e4) will be drawn as

directed graph