The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________

Explore topic-wise MCQs in Data Structure Questions and Answers.

This section includes 1 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.

1.	The number of possible undirected graphs which may have self loops but no multiple edges and have 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» E.

Discussion