3 . Consider the following directed graph :
( a ) Write down the
( i ) in-degree of B ;
( ii ) out-degree of B .
( b ) Write down the adjacency matrix M of the graph .
( c ) Hence , find the total number of walks of length 12 from D to B .
[ 2 ]
[ 3 ]
[ 2 ]
4 . Consider the following directed graph :
9
( a ) Write down the
( i ) in-degree of A ;
( ii ) out-degree of D .
( b ) Write down the adjacency matrix M of the graph .
( c ) Hence , find the total number of walks of length at most 3 from A to E .
[ 2 ]
[ 3 ]
[ 2 ] www . seprodstore . com
127