31.  For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is 
Answer: (c).2e

32.  A complete graph can have ............... 
Answer: (b). n^(n2) spanning trees

33.  Graph traversal is different from a tree traversal, because: 
Answer: (c).trees have root

34.  The number of edges in a simple, nvertex, complete graph is 
Answer: (c).n*(n1)/2

35.  Graphs are represented using ............ 
Answer: (b).Adjacency linked list

36.  The spanning tree of connected graph with 10 vertices contains .............. 
Answer: (a).9 edges

37.  If locality is a concern, you can use ................ to traverse the graph. 
Answer: (b).Depth First Search

38.  Which of the following algorithms solves the allpair shortest path problem? 
Answer: (a).Floyd's algorithm

39.  The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is 
Answer: (b).2

40.  Which of the following is useful in traversing a given graph by breadth first search? 
Answer: (d).Queue
