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

Related MCQs

• A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
• 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?
• The number of edges in a complete graph of n vertices is
• 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?