- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Can there exist a graph which is both eu...

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. |

View all MCQs in:
Design and Analysis of Algorithms

- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- What is the chromatic number of compliment of line graph of bipartite graph?
- What is the clique size of the line graph of bipartite graph?
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- Which structure can be modelled by using Bipartite graph?
- A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
- Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?

Login to Continue

It will take less than 2 minutes

Report MCQ