Nielit Scientist-B CS 4-12-2016
April 5, 2025Nielit Scientist-B CS 4-12-2016
April 5, 2025Nielit Scientist-B CS 4-12-2016
|
Question 5
|
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to:
|
3
|
|
|
4
|
|
|
5
|
|
|
6
|
Question 5 Explanation:
v – e + f = 2
‘v’ is number of vertices and ‘e’ is number of edges
‘f’ is number of faces including bounded and unbounded
10 – 15 + f = 2
f = 7
There is always one unbounded face, so the number of bounded faces = 6
‘v’ is number of vertices and ‘e’ is number of edges
‘f’ is number of faces including bounded and unbounded
10 – 15 + f = 2
f = 7
There is always one unbounded face, so the number of bounded faces = 6
Correct Answer: D
Question 5 Explanation:
v – e + f = 2
‘v’ is number of vertices and ‘e’ is number of edges
‘f’ is number of faces including bounded and unbounded
10 – 15 + f = 2
f = 7
There is always one unbounded face, so the number of bounded faces = 6
‘v’ is number of vertices and ‘e’ is number of edges
‘f’ is number of faces including bounded and unbounded
10 – 15 + f = 2
f = 7
There is always one unbounded face, so the number of bounded faces = 6