1.

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» E.


Discussion

No Comment Found