71. | In the given connected graph G, what is the value of rad(G) and diam(G)? |
Answer: (a).2, 3
|
72. | Which of these adjacency matrices represents a simple graph? |
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. |
Answer: (c).6
|
74. | If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y. |
Answer: (a).x=5, y=3
|
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. |
Answer: (a).True
|
76. | Given the following program, what will be the 3rd number that’d get printed in the output sequence for the given input?
|
Answer: (c).8
|
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<n<10).
|
Answer: (b).All Empty Graphs
|
78. | Given the following adjacency matrix of a graph(G) determine the number of components in the G. [0 1 1 0 0 0], [1 0 1 0 0 0], [1 1 0 0 0 0], [0 0 0 0 1 0], [0 0 0 1 0 0], [0 0 0 0 0 0]. |
Answer: (c).3
|
79. | Incidence matrix and Adjacency matrix of a graph will always have same dimensions? |
Answer: (b).False
|
80. | The column sum in an incidence matrix for a simple graph is __________ |
Answer: (c).equal to 2
|