Proof any two simple connected graphs with n vertices, all of degree two, are isomorphic
Answers
Answered by
0
two simple connected graph with n vertices all of degree 2 are isomorphic means
Answered by
0
Similar questions