Thread: Determine e(G)

For n >= 3, let G be a graph on vertices such that for every vertex v, G - v is a tree.
Determine e(G) and use this to determine G itself.

Any ideas? Thanks a lot!

What do you mean by e(G) ? G should be a single cycle.