Prove that any connected graph with at least 2 nodes has a node such that, if it is removed along with its incident edges, the graph is still connected.
Follow Math Help Forum on Facebook and Google+
The given graph has a spanning tree as a subgraph, what about its leaves ?
View Tag Cloud