- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which type of graph has no odd cycle in ...

Q. |
## Which type of graph has no odd cycle in it? |

A. | bipartite |

B. | histogram |

C. | cartesian |

D. | pie |

Answer» A. bipartite | |

Explanation: the graph is known as bipartite if the graph does not contain any odd length cycle in it. odd length cycle means a cycle with the odd number of vertices in it. |

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?
- Given that a graph contains no odd cycle. Is it enough to tell that it is bipartite?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- Every Perfect graph has forbidden graph characterization.
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
- Which graph is used to define the claw free graph?
- Which graph cannot contain K3, 3 as a minor of graph?
- Which complete graph is not present in minor of Outer Planar Graph?
- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.

Login to Continue

It will take less than 2 minutes

Report MCQ