Examveda

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: Option D

This Question Belongs to Data Structure >> Graphs

Join The Discussion

Related Questions on Graphs

A. A directed graph has nodes with unique identifiers, while an undirected graph does not.

B. A directed graph has edges with direction, while an undirected graph does not.

C. There is no difference between them.

D. A directed graph has nodes with unique identifiers, while an undirected graph does not.

View Answer

A. O(V log V)

B. O(E)

C. O(V²)

D. O(V + E)

View Answer

A. It contains a cycle of odd length.

B. It can be represented using only one adjacency list.

C. It has no edges.

D. It can be colored using two colors such that no two adjacent vertices share the same color.

View Answer

A. A path that starts and ends at the same vertex with no other repetitions.

B. A path that includes all vertices exactly once.

C. A path with no edges.

D. A complete traversal of all vertices.

View Answer