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

Sequences, counting (including probability), logic and truth tables, algorithms, number theory, set theory, etc.
noodow121
Posts: 1
Joined: Sun Oct 16, 2016 8:20 pm
Contact:

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

Postby noodow121 » Sun Oct 16, 2016 8:25 pm

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.

Return to “Discrete Math”