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!
Follow Math Help Forum on Facebook and Google+
What do you mean by e(G) ? G should be a single cycle.
View Tag Cloud