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?
(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.