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?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Data Structure (DS)

Q. 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

💬 Discuss

✅ Correct Answer: (B) v = e+1

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

509

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate