Que: 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 ______

a. Complete bipartite graph
b. Hamiltonian cycle
c. Regular graph
d. Euler graph
Answer: Euler graph

Leave a Comment