41.  The minimum number of edges in a connected cyclic graph on n vertices is 
Answer: (a).n

42.  The number of edges in a regular graph of degree d and n vertices is 
Answer: (c).nd/2

43.  In the given graph identify the cut vertices. 
Answer: (d).C and B

44.  For the given graph(G), which of the following statements is true? 
Answer: (c).The vertex connectivity of the graph is 2

45.  The given Graph is regular. 
Answer: (a).True

46.  In the following DAG find out the number of required Stacks in order to represent it in a Graph Structured Stack. 
Answer: (c).3

47.  Which of the following graphs are isomorphic to each other? 
Answer: (d).fig 1, fig 2 and fig 3

48.  In the given graph which edge should be removed to make it a Bipartite Graph? 
Answer: (a).AC

49.  What would be the DFS traversal of the given Graph? 
Answer: (a).ABCED

50.  What is the number of words that can be formed from the given Directed Acyclic Word Graph? 
Answer: (b).4
