Let G be a connected simple graph such that |E(G)|=|V(G)|.

How do I show that if G has no leaf, then G is isomorphic to Pn for some n? Where Pn is the polygon with n sides.

Let G be a connected simple graph such that |E(G)|=|V(G)|.

How do I show that if G has no leaf, then G is isomorphic to Pn for some n? Where Pn is the polygon with n sides.

How do I show that if G has no leaf, then G is isomorphic to Pn for some n? Where Pn is the polygon with n sides.