M

Mr. Dubey • 52.49K Points
Coach

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              

(A) complete bipartite graph
(B) hamiltonian cycle
(C) regular graph
(D) euler graph
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.


Question analytics