71. In the given connected graph G, what is the value of rad(G) and diam(G)? a. 2, 3 b. 3, 2 c. 2, 2 d. 3, 3

 72. Which of these adjacency matrices represents a simple graph? a. [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ] b. [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ] c. [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ] d. [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]
 Answer: (d).[ [0, 0, 1], [1, 0, 1], [1, 0, 0] ]

 73. Given an adjacency matrix A = [ [0, 1, 1], [1, 0, 1], [1, 1, 0] ], how many ways are there in which a vertex can walk to itself using 2 edges. a. 2 b. 4 c. 6 d. 8

 74. If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y. a. x=5, y=3 b. x=3, y=5 c. x=3, y=3 d. x=5, y=5

 75. Two directed graphs(G and H) are isomorphic if and only if A=PBP-1, where P and A are adjacency matrices of G and H respectively. a. True b. False c. May be d. Can't say

 76. Given the following program, what will be the 3rd number that’d get printed in the output sequence for the given input? #include using namespace std; int cur=0; int G[10][10]; bool visited[10]; deque q; void fun(int n); int main() { int num=0; int n; cin>>n; for(int i=0;i>G[i][j]; for(int i=0;i

 77. For which type of graph, the given program would run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1 using namespace std; int G[10][10]; void fun(int n); int main() { int num=0; int n; cin>>n; for(int i=0;i>G[i][j]; fun(n); return 0; } void fun(int n) { for(int i=0;i