G is a connected simple undirected graph. Some vertices of G are of odd…

PYQ GATE 2008Modified — 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

  1. A.

    regular

  2. B.

    Complete

  3. C.

    Hamiltonian

  4. D.

    Euler

Attempted by 381 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…