E
18 ஐ
b)
19 ஐ
b)
20 a)
b)

E1199 Pages: 5

If A(G) is an incidence matrix of a connected graph G with n vertices, then the 5
rank of A(G) is n-1.
How is Kruskal’s algorithm used to find minimum cost spanning tree of a graph. 5

Find a minimum spanning tree in the graph below.

Give an algorithm to check whether a graph is connected or not. How it can be 5
implemented with an adjacency matrix.

Give any five properties of circuit matrix. 5
How are edge listing and linear arrays used in computer representation of 5

graph?

Page 5 of 5