| 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 |
| 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. | |
Login to Continue
It will take less than 2 minutes