UGC NET CSE | August 2016 | Part 2 | Question: 22

Question

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

• A. $726$
• B. $796$
• C. $506$
• D. $616$

Answer 1

this answer given in made easy book .I also don't understand if any please rply

Comments

Look here : https://gateoverflow.in/1931/gate2014-1-51