- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The problem of finding a path in a graph...

Q. |
## The problem of finding a path in a graph that visits every vertex exactly once is called? |

A. | hamiltonian path problem |

B. | hamiltonian cycle problem |

C. | subset sum problem |

D. | turnpike reconstruction problem |

Answer» A. hamiltonian path problem | |

Explanation: hamiltonian path problem is a problem of finding a path in a graph that visits every node exactly once whereas hamiltonian cycle problem is finding a cycle in a graph. |

View all MCQs in:
Design and Analysis of Algorithms

- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
- 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?
- 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?
- Every Perfect graph has forbidden graph characterization.
- Is every complete bipartite graph a Moore Graph.
- Is it true that every complete bipartite graph is a modular graph.
- 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 graph has a size of minimum vertex cover equal to maximum matching?

Login to Continue

It will take less than 2 minutes

Report MCQ