Q. Can there exist a graph which is both eulerian and is bipartite?

(A) yes
(B) no
(C) yes if it has even number of edges
(D) nothing can be said

💬 Discuss

✅ Correct Answer: (A) yes

Explanation: if a graph is such that there exists a path which visits every edge atleast once, then it is said to be eulerian. taking an example of a square, the given question evaluates to yes.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

if a graph is such that there exists a path which visits every edge atleast once, then it is said to be eulerian. taking an example of a square, the given question evaluates to yes.

💬 Discussion

📊 Question Analytics

👁️

554

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate

Q. Can there exist a graph which is both eulerian and is bipartite?

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics