Solution. We observe that a12 = 1, a23 = 1, a34 = 1, a35 = 1, a41 = 1, a42 = 1. Hence the digraph is as shown in Figure 17.145.

 

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

 

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 ...

Get Engineering Mathematics, Volume I, Second Edition now with the O’Reilly learning platform.

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.