GATE | IT | 2008 | Discrete maths | Graph theory | Question 26

Last Updated :
Discuss
Comments

G is a simple undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to each odd degree vertex of G. The resultant graph is sure to be

regular

Complete

Hamiltonian

Euler

This question is part of this quiz :

Top MCQs on Graph Theory in Mathematics,Gate IT 2008
Tags:
Engineering Mathematics Questions
GATE
Share your thoughts in the comments