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
An ordered n-tuple (d1, d2,..., dn) with d1 ≥ d2 ≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d...
An ordered n-tuple (d1, d2,..., dn) with d1 ≥ d2 ≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d...
An ordered n-tuple (d1, d2,..., dn) with d1 ≥ d2 ≥... ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d...
Total Unique Visitors
Loading......