Multiple choice Maximum number of edges in a n-node undirected graph without self loops is n2 $\dfrac{n(n-1)}{2}$ (n-1) $\dfrac{(n-1)(2)}{2}$ Reveal answer Fill a bubble to check yourself B Correct answer Explanation