Multiple Choice Questions On Discrete Structure - Set 3

1) A tour of G is a closed walk of graph G which includes every edge G at least once. A ..... tour of G is a tour which includes every edge of G exactly once ? HamiltonianPlanarIsomorphicEulerShow/Hide Answer Answer = D Explanation: If some closed walk in a graph contains all the edges then the walk is called Euler.2) Which of the following is not a type of graph ? EulerHamiltonianTreePathShow/