menu
home
Home
search
Search
people
About Us
exit_to_app
Login
home
Home
search
Search
people
About Us
exit_to_app
Login
Practicing for Undirected Graph of Data Structure
Questions 1 of 8
Q. The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________
2
((n*n)/2)
2
((n-1)*(n-1))/2)
2
((n*(n-1))/2)
2
((n*(n+1))/2)
Submit
lock
Login
person
Signup
Email
Password
Name
Email
Password
Confirm Password