

MCQOPTIONS
Saved Bookmarks
1. |
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 |
Answer» B. n-1 | |