G is a graph with adjacency matrix A. We know the following about the matrix A: • The 2nd row of A is: 00111 • The 2nd row of A² is: • The 2nd row of A³ is: How many routes are there that connect vertex 2 to vertex 5 of length exactly 3? Your Answer: 03012 01014 Answer

3. Represent the following graph using 1) adjacency list 2) an an adjacency matrix. a e

Plz correct  solution.

Consider the network with N = 4 nodes and adjacency matrix A given by 0 1 1 1 0 1 1 A = 0000 0000 (a) Calculate the number of links in the network and draw the network. Is the network directed or undirected? (b) Is the network weakly connected? Is the network strongly connected? List the nodes belonging to each of the strongly-connected components in the network.