How many Hamiltonian paths does the following graph have?

Related MCQs

• How many Hamiltonian paths does the following graph have?
• 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)?
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
• Which of the following problems is similar to that of a Hamiltonian path problem?
• Berge graph is similar to              due to strong perfect graph theorem.
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• Let G be an arbitrary graph with v nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie down between            and            
• A path of a graph is said to be ______ if it contains all the edges of the graph.