Question

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.

Answer 1

Correct answer is (b) v = e+1

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