Graph Theorymedium
0:00.0

In a graph GG with nn vertices, let d(v)d(v) denote the degree of vertex vv. If GG is a connected graph where d(v)n2d(v) \geq \frac{n}{2} for every vertex vv, which of the following is a guaranteed property of GG?