+1 vote
in Data Structures & Algorithms I by (88.2k points)
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)

This interesting question is from Undirected Graph in portion Graph of Data Structures & Algorithms I

The question was posed to me in an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct option is (d) 2^((n*n)/2)

The explanation is: There can be at most, n*n edges in an undirected graph.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.