MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The number of edges in a regular graph of degree 46 and 8 vertices is ____________ |
| A. | 347 |
| B. | 230 |
| C. | 184 |
| D. | 186 |
| Answer» D. 186 | |
| 2. |
If G is the forest with 54 vertices and 17 connected components, G has _______ total number of edges. |
| A. | 38 |
| B. | 37 |
| C. | 17/54 |
| D. | 17/53 |
| Answer» C. 17/54 | |
| 3. |
In a ______ the vertex set and the edge set are finite sets. |
| A. | finite graph |
| B. | bipartite graph |
| C. | infinite graph |
| D. | connected graph |
| Answer» C. infinite graph | |
| 4. |
A ______ is a graph which has the same number of edges as its complement must have number of vertices congruent to 4m or 4m modulo 4(for integral values of number of edges). |
| A. | Subgraph |
| B. | Hamiltonian graph |
| C. | Euler graph |
| D. | Self complementary graph |
| Answer» E. | |
| 5. |
Berge graph is similar to ______ due to strong perfect graph theorem. |
| A. | line graph |
| B. | perfect graph |
| C. | bar graph |
| D. | triangle free graph |
| Answer» C. bar graph | |
| 6. |
Triangle free graphs have the property of clique number is __________ |
| A. | less than 2 |
| B. | equal to 2 |
| C. | greater than 3 |
| D. | more than 10 |
| Answer» E. | |
| 7. |
If each and every vertex in G has degree at most 23 then G can have a vertex colouring of __________ |
| A. | 24 |
| B. | 23 |
| C. | 176 |
| D. | 54 |
| Answer» B. 23 | |
| 8. |
In a 7-node directed cyclic graph, the number of Hamiltonian cycle is to be ______ |
| A. | 728 |
| B. | 450 |
| C. | 360 |
| D. | 260 |
| Answer» D. 260 | |