+1 vote
in Data Structures & Algorithms I by (88.2k points)
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?

(a) v=e

(b) v = e+1

(c) v + 1 = e

(d) v = e-1

My doubt is from Graph topic in portion Graph of Data Structures & Algorithms I

I had been asked this question in an international level competition.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct answer is (b) v = e+1

For explanation: For any connected graph with no cycles the equation holds true.

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.