Computer Sciences > GATE 2021 SET-1 > Graph Theory
Let G = (V, E) be an undirected unweighted connected graph. The diameter of G is defined as:
diam(G) = maxu,v∈V {the length of shortest path between u and v}
Let M be the adjacency matrix of G. Define graph G2 on the same set of vertices with adjacency matrix N, where
Which one of the following statements is true?
diam(G) = maxu,v∈V {the length of shortest path between u and v}
Let M be the adjacency matrix of G. Define graph G2 on the same set of vertices with adjacency matrix N, where
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.