Consider an undirected graph \(G\) where self-loops are not allowed. The…

PYQ GATE 2014

Consider an undirected graph GG where self-loops are not allowed. The vertex set of GG is {(i,j)∣1≤i≤12,1≤j≤12}\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}. There is an edge between (a,b)(a,b)  and (c,d)(c,d) if ∣a−c∣≤1|a-c| \leq 1 and ∣b−d∣≤1|b-d| \leq 1. The number of edges in this graph is______.

Attempted by 254 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…