Computer Sciences > GATE 2014 SET-1 > Graph Theory
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a - c| ≤ 1 and |b - d| ≤ 1. The number of edges in this graph is _______.
Correct : 506
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......