G is a connected simple undirected graph. Some vertices of G are of odd…
GATE · 2008 · ITModified — slightly modified from the official paper; see the solution
G is a connected 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
Attempted by 333 students.
Sign up free to check your answer
Sign up freeLoading lesson…