Q. The number of possible undirected graphs which may have self loops but no multiple edges andhave n vertices is (Solved)
1. 2((n*(n-1))/2)
2. 2((n*(n+1))/2)
3. 2((n-1)*(n-1))/2)
4. 2((n*n)/2)
- d. 2((n*n)/2)
1. 2((n*(n-1))/2)
2. 2((n*(n+1))/2)
3. 2((n-1)*(n-1))/2)
4. 2((n*n)/2)