A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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
a. regular
b. Complete
c. Hamiltonian
d. Euler
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here