Q1.25MCQ1 mark, −0.25The maximum number of edges in a nnn-node undirected graph without self loops is(A)n2n^2n2(B)n(n−1)2\frac{n(n-1)}{2}2n(n−1)(C)n−1n-1n−1(D)(n+1)(n)2\frac{(n+1)(n)}{2}2(n+1)(n)Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google