Vidyalelo
Data Structure · Q96

Graphs

Programming · Data Structure · question 96

Q96

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
Answer
C.
v + 1 = e
D.
v = e-1

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board