M
Q. How many Hamiltonian paths does the following graph have?
Explanation by: Mr. Dubey
the above graph has no hamiltonian paths. that is, we cannot traverse the graph with meeting vertices exactly once.
You must be Logged in to update hint/solution
Be the first to start discuss.
Related MCQs
Q. The sequential circuit is also called
Q. Which is the best definition of an interaction mode?
Q. Which of the following is not binary operation?
Q. The field determines the lifetime of IPv6 datagram
Q. ---------- it includes the steps of maintenance phase of software.
Q. The disadvantage in using a circular linked list is …………………….
Q. Fault-based testing is best reserved for
Q. Which of the following statements is not true for lower level management?
Question analytics
Discusssion
Login to discuss.