a) 2((n*(n-1))/2)
b) 2((n*(n+1))/2)
c) 2((n-1)*(n-1))/2)
d) 2((n*n)/2)
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is _______
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is _______
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!