πŸ“Š Design and Analysis of Algorithms
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.


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

πŸ‘οΈ
530
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
80%
Success Rate