Re: discrete math with graph.

["Hero"]

mina_world schrieb:

> hello sir~
>
> G is a simple connected graph.
>
> the "mean" of degrees of vertexs is bigger than 2.
> (namely, > 2)
>
> show that G contains at least two cycles.

Start with three vertices (vertexs) and then
induction from n to n+1.
Hero