Shown is a network whose adjacency matrix is
List all the paths of length 2 from node 1 to node 1.
The number of paths of length from node to node is given by , the th entry of the matrix . How many paths of length 3 are there from node 1 to node 2?
Write down the adjacency matrix of the network shown.
When a connection in a network does not have an arrow, it is said to be ‘undirected’. An undirected connection between nodes and is equivalent to a directed connection from to together with a directed connection from to . Determine the adjacency matrix of the network shown.