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 ______

G is a simple undirected graph and some vertices of G are of odd degre

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.