Which of the following is not a type of graph?EulerHamiltonianTreePath

Question

asked Jun 27, 2023 33.7k views

1 Answer

← Prev Question Next Question →

Ask a Question

Afilu · Answer 1 · 2023-07-03T08:21:46+0000

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.

Which of the following is not a type of graph?EulerHamiltonianTreePath

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Please log in or register to add a comment.

No related questions found

Categories

Other Questions