# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Properties of Bipartite Graphs Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which type of graph has no odd cycle in it?

Bipartite | |

Histogram | |

Cartesian | |

Pie |

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

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What type of graph has chromatic number less than or equal to 2?

Histogram | |

Bipartite | |

Cartesian | |

Tree |

Question 2 Explanation:

A graph is known as bipartite graph if and only if it has the total chromatic number less than or equal to 2. The smallest number of graphs needed to color the graph is chromatic number.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following is the correct type of spectrum of the bipartite graph?

Symmetric | |

Anti - Symmetric | |

Circular | |

Exponential |

Question 3 Explanation:

The spectrum of the bipartite graph is symmetric in nature. The spectrum is the property of graph that are related to polynomial, Eigen values, Eigen vectors of the matrix related to graph.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following is the property of the bipartite graph?

No Odd Cycle | |

Symmetric spectrum | |

Chromatic Number Is Less Than or Equal to 2 | |

All of the mentioned |

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

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which one of the following is the chromatic number of bipartite graph?

1 | |

4 | |

3 | |

5 |

Question 5 Explanation:

A graph is known as bipartite graph if and only if it has the total chromatic number less than or equal to 2. The smallest number of graphs needed to color the graph is the chromatic number.

There are 5 questions to complete.