Data Structure
Java
Python
HTML
Interview Preparation
- Interview Prep
- Tutorials
- Tracks
GATE | CS | 2014 | Set 1 | Discrete Mathematics | Graph Theory | Question 33
Last Updated :
Discuss
Comments
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 __________.
500
502
506
510
This question is part of this quiz :
Top MCQs on Graph Theory in Mathematics,GATE-CS-2014-(Set-1),Topic Wise Quiz on Graph TheoryShare your thoughts in the comments
GeeksforGeeks