Answer:
Explanation:
Answer = D Explanation: If some closed walk in a graph contains all the edges then the walk is called Euler. 32) Which of the following is not a type of graph ? Answer = D Explanation:Path is a way from one node no another but not a graph.