- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following has maximum cliqu...

Q. |
## Which of the following has maximum clique size 2? |

A. | perfect graph |

B. | tree |

C. | histogram |

D. | cartesian |

Answer» A. perfect graph | |

Explanation: the perfect bipartite graph has clique size 2. also, 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. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the clique size of the line graph of bipartite graph?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- Maximum matching is also called as maximum cardinality matching.
- 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?
- Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?
- 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?
- Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.
- A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
- In which of the following cases the minimum no of insertions to form palindrome is maximum?
- In which of the following cases, the maximum sum rectangle is the 2D matrix itself?

Login to Continue

It will take less than 2 minutes

Report MCQ