Data Structure (DS) MCQ: 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?

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?

Correct Answer: v = e+1

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure (DS) MCQs All Engineering topics Mock test hub