- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- How many Hamiltonian paths does the foll...

Q. |
## How many Hamiltonian paths does the following graph have? |

A. | 1 |

B. | 2 |

C. | 0 |

D. | 3 |

Answer» C. 0 | |

Explanation: the above graph has no hamiltonian paths. that is, we cannot traverse the graph with meeting vertices exactly once. |

View all MCQs in:
Design and Analysis of Algorithms

- How many Hamiltonian paths does the following graph have?
- There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
- 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?
- For a graph of degree three, in what time can a Hamiltonian path be found?
- What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
- 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?
- Consider the graph shown below. Which of the following are the edges in the MST of the given graph?
- Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?

Login to Continue

It will take less than 2 minutes

Report MCQ