| 61. | For which of the following combinations of the degrees of vertices would the connected graph be eulerian? |
| Discuss |
|
Answer: (a).1,2,3
|
| 62. | A graph with all vertices having equal degree is known as a __________ |
| Discuss |
|
Answer: (b).Regular Graph
|
| 63. | Which of the following ways can be used to represent a graph? |
| Discuss |
|
Answer: (c).Adjacency List, Adjacency Matrix as well as Incidence Matrix
|
| 64. | The number of elements in the adjacency matrix of a graph having 7 vertices is __________ |
| Discuss |
|
Answer: (d).49
|
| 65. | What would be the number of zeros in the adjacency matrix of the given graph? |
| Discuss |
|
Answer: (b).6
|
| 66. | Adjacency matrix of all graphs are symmetric. |
| Discuss |
|
Answer: (a).False
|
| 67. | The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________ |
| Discuss |
|
Answer: (d).O(V^2)
|
| 68. | For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree. |
| Discuss |
|
Answer: (b).out, in
|
| 69. | What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices? |
| Discuss |
|
Answer: (c).n*(n-1)
|
| 70. | On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends? |
| Discuss |
|
Answer: (c).Is independent of both the number of edges and vertices
|
