1

G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is

Correct Answer: euler graph

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: G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is | Extra Education