The number of possible undirected graphs which may have self loops but – McqOptions

MCQOPTIONS

1.	The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________
A.	2<sup>((n*(n-1))/2)</sup>
B.	2<sup>((n*(n+1))/2)</sup>
C.	2<sup>((n-1)*(n-1))/2)</sup>
D.	2<sup>((n*n)/2)</sup>
Answer» E.

Discussion

No Comment Found

Related MCQs

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?
In the given graph which edge should be removed to make it a Bipartite Graph?
Which of the following graphs are isomorphic to each other?
How many of the following statements are correct?i) All cyclic graphs are complete graphs.ii) All complete graphs are cyclic graphs.iii) All paths are bipartite.iv) All cyclic graphs are bipartite.v) There are cyclic graphs which are complete.
Number of vertices with odd degrees in a graph having a eulerian walk is ________
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________
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?$
All trees with n vertices consists of n-1 edges.
What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
All paths and cyclic graphs are bipartite graphs.