31. | For an undirected graph G with n vertices and e edges, the sum of the degrees of each vertex is |
Discuss |
Answer: (c).2e
|
32. | A complete graph can have ............... |
Discuss |
Answer: (b). n^(n-2) spanning trees
|
33. | Graph traversal is different from a tree traversal, because: |
Discuss |
Answer: (c).trees have root
|
35. | Graphs are represented using ............ |
Discuss |
Answer: (b).Adjacency linked list
|
36. | The spanning tree of connected graph with 10 vertices contains .............. |
Discuss |
Answer: (a).9 edges
|
37. | If locality is a concern, you can use ................ to traverse the graph. |
Discuss |
Answer: (b).Depth First Search
|
38. | Which of the following algorithms solves the all-pair shortest path problem? |
Discuss |
Answer: (a).Floyd's algorithm
|
39. | The minimum number of colors needed to color a graph having n (>3) vertices and 2 edges is |
Discuss |
Answer: (b).2
|
40. | Which of the following is useful in traversing a given graph by breadth first search? |
Discuss |
Answer: (d).Queue
|