A path of a graph is said to be ______ if it contains all the edges of the graph.

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Discrete Mathematics

Q. A path of a graph is said to be ______ if it contains all the edges of the graph.

(A) eulerian
(B) hamiltonian
(C) tournament
(D) planar

💬 Discuss

✅ Correct Answer: (A) eulerian

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

87

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate