Prove that any two connected graphs of order n with degree sequence (2,2,...,2) are isomorphic.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud