1. Computer Science Engineering (CSE)
  2. Theory of Computation
  3. Unit 1
  4. If G is a simple connected 3-regular pla...
Q.

If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is

A. 3
B. 4
C. 6
D. 5
Answer» C. 6
View all MCQs in:   Theory of Computation

Discussion