- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following is not a property...

Q. |
## Which of the following is not a property of the bipartite graph? |

A. | no odd cycle |

B. | symmetric spectrum |

C. | chromatic number is less than or equal to 2 |

D. | asymmetric spectrum |

Answer» D. asymmetric spectrum | |

Explanation: a graph is known to be bipartite if it has odd length cycle number. it also has symmetric spectrum and the bipartite graph contains the total chromatic number less than or equal to 2. |

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?
- 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.
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
- Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?
- Which of the following is the correct type of spectrum of the bipartite graph?

Login to Continue

It will take less than 2 minutes

Report MCQ