1

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

Correct Answer: 2((n*n)/2)

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.