Latest Gate Aptitude Question SOLUTION: Le t 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

• Placement Papers
• /
• Gate

Gate Question Papers:

(#M40029648) GATE question GATE-CS Keep an EYE

Le t 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

option
(A) 3
(B) 4
(C) 5
(D) 6

Asked In Gate Rats (10 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution