For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

(A) 1,2,3
(B) 2,3,4
(C) 2,4,5
(D) 1,3,5

💬 Discuss

✅ Correct Answer: (A) 1,2,3

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

302

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

96%

Success Rate