33.7k views
1 vote
Which of the following is not a type of graph?EulerHamiltonianTreePath

User Raghul SK
by
6.7k points

1 Answer

4 votes

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.

User Afilu
by
8.2k points