Maximum number of edges in an n-node undirected graph without self loops is ____.

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Discrete Mathematics

Q. Maximum number of edges in an n-node undirected graph without self loops is ____.

(A) [n(n-a)]/2
(B) n-1
(C) n
(D) [n(n+a)]/2

💬 Discuss

✅ Correct Answer: (A) [n(n-a)]/2

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

194

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate