Q52

MCQ2 marks, −0.67

Let $\delta$ denote the minimum degree of a vertex in a graph. For all planar graphs on $n$ vertices with $\delta \geq 3$ , which one of the following is TRUE?

(A)

In any planar embedding, the number of faces is at least $\frac{n}{2}+2$

(B)

In any planar embedding, the number of faces is less than $\frac{n}{2}+2$

(C)

There is a planar embedding in which the number of faces is less than $\frac{n}{2}+2$

(D)

There is a planar embedding in which the number of faces is at most $\frac {n}{\delta+1}$

Loading…