+1 vote
in Data Structures & Algorithms I by (88.2k points)
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?

(a) 1

(b) 2

(c) 3

(d) 4

Origin of the question is Undirected Graph in chapter Graph of Data Structures & Algorithms I

I had been asked this question during an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
The correct option is (b) 2

Easiest explanation - Euler’s Identity says V – E + R  = 1+ number of connected components.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.