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.
Q. Can there exist a graph which is both eulerian and is bipartite?
β
Correct Answer: (A)
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