| 51. | Determine the longest string which is described by the given Directed Acyclic Word Graph.
 |
|
Answer: (a).BATS
|
| 52. | Which of the following statements for a simple graph is correct? |
|
Answer: (a).Every path is a trail
|
| 53. | What is the number of edges present in a complete graph having n vertices? |
|
Answer: (b).(n*(n-1))/2
|
| 54. | In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices. |
|
Answer: (b).False
|
| 55. | A connected planar graph having 6 vertices, 7 edges contains _____________ regions. |
|
Answer: (b).3
|
| 56. | If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________ |
|
Answer: (c).(n*n-n-2*m)/2
|
| 57. | Which of the following properties does a simple graph not hold? |
|
Answer: (a).Must be connected
|
| 58. | What is the maximum number of edges in a bipartite graph having 10 vertices? |
|
Answer: (c).25
|
| 59. | Which of the following is true? |
|
Answer: (b).A graph may contain many edges and no vertices
|
| 60. | 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? |
|
Answer: (b).v = e+1
|
