UGC NET June-2019 CS Paper-2
November 29, 20232013 June UGC NET Paper 1
November 29, 2023UGC NET June-2019 CS Paper-2
|
Question 20
|
Suppose that a connected planar graph has six vertices, each of degrees four. Into how many regions is the plane divided by a planar representation of this graph?
|
6
|
|
|
8
|
|
|
12
|
|
|
10
|
Question 20 Explanation:
We apply Euler’s formula where r = e−v + 2.
Since each vertex has degree 4, the sum of the degrees is 24.
By the handshaking theorem, 2e = 24 .
so, e = 12.
r = 12−6 + 2
r = 8
Thus we have 8 regions in this planar graph.
Since each vertex has degree 4, the sum of the degrees is 24.
By the handshaking theorem, 2e = 24 .
so, e = 12.
r = 12−6 + 2
r = 8
Thus we have 8 regions in this planar graph.
Correct Answer: B
Question 20 Explanation:
We apply Euler’s formula where r = e−v + 2.
Since each vertex has degree 4, the sum of the degrees is 24.
By the handshaking theorem, 2e = 24 .
so, e = 12.
r = 12−6 + 2
r = 8
Thus we have 8 regions in this planar graph.
Since each vertex has degree 4, the sum of the degrees is 24.
By the handshaking theorem, 2e = 24 .
so, e = 12.
r = 12−6 + 2
r = 8
Thus we have 8 regions in this planar graph.