Prove that any two simple connected graph with ‘n’vertices all of degree two are isomorphic.

B.Sc III [ Semester -VI ( Paper-XII) ]

Graph Theory 

Prove that any two simple connected graph with ‘n’vertices all of Degree two are isomorphic.

Comments

Post a Comment