Engineering Mathematics, Volume I, Second Edition

Solution. We observe that a₁₂ = 1, a₂₃ = 1, a₃₄ = 1, a₃₅ = 1, a₄₁ = 1, a₄₂ = 1. Hence the digraph is as shown in Figure 17.145.

 

 

Figure 17.145

Definition 17.82 In a directed graph, if there is no more than one directed edge in a particular direction between a pair of vertices, then it is called simple directed graph.

For example, the graph shown in Figure 17.146 is a simple directed graph.

 

 

Figure 17.146

 

A directed graph which is not simple is called directed multi-graph.

Definition 17.83 A simple digraph is said to be strongly connected ...