McqMate

Q. |
## What is the clique size of the line graph of bipartite graph? |

A. | 0 |

B. | 1 |

C. | 2 |

D. | 3 |

Answer» C. 2 | |

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

2.7k

0

Do you find this helpful?

44

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is testing of a complete bipartite subgraph in a bipartite graph problem called?
- 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 the chromatic number of compliment of line graph of bipartite graph?
- Which of the following has maximum clique size 2?
- 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?
- Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- When is a graph said to be bipartite?