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

Computer Science Engineering (CSE)
Data Structures (DS)
Non Linear Data Structures - Graphs
The number of possible undirected graphs...

Q.	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» D. 2((n*n)/2)

View all MCQs in: Data Structures (DS)

Discussion

Related Questions

What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
The number of edges in a regular graph of degree d and n vertices is _______.
What is the number of edges present in a complete graph having n vertices?
What is the maximum number of edges in a bipartite graph having 10 vertices?
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
A connected planar graph having 6 vertices, 7 edges contains regions.
With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?