For an undirected graph G=(V, E) and a vertex v in V, let G\v denote the
subgraph of G obtained by removing v and all the edges incident to v from G. If G is
connected, then G\v can be connected or disconnected. Prove that for any connected graph G,
we can always find a vertex v in G such that G\v is connected.
目前我的想法是1)没有循环:视为树,leaf必定是non-cut
2)有循环:有循环的话,degree不是最大的应该都可以是non-cut?
请问一下,我的观念是否有错?
还有如何用数学归纳法证明呢?