Question 1
Which of the following is a necessary condition for a graph to have an Eulerian circuit?
Question 2
A Hamiltonian cycle in a graph is defined as:
Question 3
Which of the following graphs definitely contains a Hamiltonian path?
Question 4
Consider a connected undirected graph with 6 vertices and 7 edges. Which of the following statements is true about this graph?
Question 5
Which of the following is an example of a graph traversal algorithm used to determine connectivity between vertices?
