McqMate

Q. |
## What is testing of a complete bipartite subgraph in a bipartite graph problem called? |

A. | p problem |

B. | p-complete problem |

C. | np problem |

D. | np-complete problem |

Answer» D. np-complete problem | |

Explanation: np stands for nondeterministic polynomial time. in a bipartite graph, the testing of a complete bipartite subgraph in a bipartite graph is an np-complete problem. |

4.3k

0

Do you find this helpful?

28

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- If all the weights of the graph are positive, then the minimum spanning tree of the graph is a minimum cost subgraph.
- 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?
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- 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?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- 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?
- Which term defines all the complete bipartite graph that are trees?
- Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?