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
Correct : a
Similar Questions
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represen...
Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected co...
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, a...
Total Unique Visitors
Loading......