Q. 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               (Solved)

1. complete bipartite graph

2. hamiltonian cycle

3. regular graph

4. euler graph

  • d. euler graph
Subscribe Now

Get All Updates & News