The number of possible undirected graphs which may have self loops but no multiple edges andhave n vertices is
A. 2((n*(n-1))/2)
B. 2((n*(n+1))/2)
C. 2((n-1)*(n-1))/2)
D. 2((n*n)/2)
Answer:D
The number of possible undirected graphs which may have self loops but no multiple edges andhave n vertices is
A. 2((n*(n-1))/2) B. 2((n*(n+1))/2) C. 2((n-1)*(n-1))/2) D. 2((n*n)/2)