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

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

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

What is the chromatic number of compliment of line graph of bipartite graph?

0 | |

1 | |

2 | |

3 |

Question 11 Explanation:

The perfect bipartite graph has chromatic number 2. So the Compliment of Line Graph of Bipartite Graph, Compliment of Bipartite Graph, Line Graph of Bipartite Graph and every Bipartite Graph has chromatic number 2.

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

What is the clique size of the line graph of bipartite graph?

0 | |

1 | |

2 | |

3 |

Question 12 Explanation:

The perfect bipartite graph has clique size 2. So the clique size of Compliment of Line Graph of Bipartite Graph, Compliment of Bipartite Graph, Line Graph of Bipartite Graph and every Bipartite Graph is 2.

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

Is it possible to have a negative chromatic number of bipartite graph?

True | |

False |

Question 13 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. But the chromatic number cannot be negative.

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

Is it true that the perfect graph has forbidden graph characterization?

True | |

False |

Question 14 Explanation:

Yes, the perfect graph also has the forbidden graph characterization. It more or less resembles the bipartite graph hence every bipartite graph is perfect graph.

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

Which structure can be modelled by using Bipartite graph?

Hypergraph | |

Perfect Graph | |

Hetero Graph | |

Directed Graph |

Question 15 Explanation:

A combinatorial structure such as Hypergraph can be made using the bipartite graphs. A hypergraph in graph theory is a type of graph in which edge can join any number of vertices.

There are 15 questions to complete.