Ononot — Consider a graph G where the number of edges |E| = \binom{n}

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryhard

0:00.0

Consider a graph $G$ where the number of edges $|E| = \binom{n}{2} - 1$ . What is the minimum possible diameter of $G$ ?