1

A path of a graph is said to be ______ if it contains all the edges of the graph.

Correct Answer: eulerian

Make the most of this question

This page focuses on one Discrete Mathematics question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Discrete Mathematics MCQ: A path of a graph is said to be ______ if it contains all the edges of the graph. | Extra Education