Register

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

• recategorized by
1,866 views
2 2 votes

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

  1. $726$
  2. $796$
  3. $506$
  4. $616$

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · UGC NET CSE | August...Next → · Confusion Please ans...
← Previous in category · UGC NET CSE | August...Next in category → · Graphs
Position:
Show:

Related questions

5 5 votes
1 1 answer
4.6k
4.6k views
Misbah Ghaya asked Sep 23, 2016
4,557 views
UGC NET CSE | August 2016 | Part 2 | Question: 5
Given the following graphs : Which of the following is correct ?$G_{1}$ contains Euler circuit and $(G_{2})$ does not contain Euler circuit.$(G_{1})$ does not cont...
2 2 votes
1 1 answer
3.3k
3.3k views
Misbah Ghaya asked Sep 28, 2016
3,338 views
UGC NET CSE | August 2016 | Part 2 | Question: 50
In Data mining, ______ is a method of incremental conceptual clustering.STRINGCOBWEBCORBAOLAD
1 1 vote
1 answers 1 answer
2.7k
2.7k views
Misbah Ghaya asked Sep 28, 2016
2,715 views
UGC NET CSE | August 2016 | Part 2 | Question: 49
Discovery of cross sales opportunities is called as _____.AssociationVisualizationCorrelationSegmentation
1 1 vote
2 2 answers
5.4k
5.4k views
Misbah Ghaya asked Sep 28, 2016
5,442 views
UGC NET CSE | August 2016 | Part 2 | Question: 48
In Data mining, classification rules are extracted from _______.DataInformationDecision TreeDatabase