1. Which of the following statements for a simple graph is correct?

2. What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

3. Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?

4. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.

5. On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

6. The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?
I. 7, 6, 5, 4, 4, 3, 2, 1
II. 6, 6, 6, 6, 3, 3, 2, 2
III. 7, 6, 6, 4, 4, 3, 2, 2
IV. 8, 7, 7, 6, 4, 2, 1, 1

7. What is the maximum number of edges in a bipartite graph having 10 vertices?

8. Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

9. The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity.

(A)   \theta(n)
(B)   \theta(m)
(C)   \theta(m + n)
(D)   \theta(mn)

10. What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?

11. What is the number of edges present in a complete graph having n vertices?

12. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.

13. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________

14. Which of the following properties does a simple graph not hold?

15. Which of the following is true?

16. 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?

17. for which of the following combinations of the degrees of vertices would the connected graph be eulerian?

18. A graph with all vertices having equal degree is known as a __________

19. Which of the following ways can be used to represent a graph?

20. The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________