MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 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. |
What is the number of edges of the greatest planar subgraph of K3,2 where m,n 3? |
| A. | 18 |
| B. | 6 |
| C. | 128 |
| D. | 702 |
| Answer» C. 128 | |
| 2. |
Suppose G be a connected planar graph of order n 5 and size m. If the length of the smallest cycle in G is 5, then which of the following is true? |
| A. | (m+n)<sup>4</sup>>=mn |
| B. | m 5/3(n 2) |
| C. | (m<sup>2</sup>+n)/3 |
| D. | n>=(6/5)(n+1) |
| Answer» C. (m<sup>2</sup>+n)/3 | |
| 3. |
If the number of vertices of a chromatic polynomial PG is 56, what is the degree of PG? |
| A. | 344 |
| B. | 73 |
| C. | 265 |
| D. | 56 |
| Answer» E. | |
| 4. |
If Cn is the nth cyclic graph, where n>3 and n is odd. Determine the value of X(Cn). |
| A. | 32572 |
| B. | 16631 |
| C. | 3 |
| D. | 310 |
| Answer» D. 310 | |
| 5. |
If a graph G is k-colorable and k<n, for any integer n then it is ___________ |
| A. | n-colorable |
| B. | n<sup>2</sup> nodes |
| C. | (k+n)-colorable |
| D. | (k<sup>3</sup>+n<sup>3</sup>+1) nodes |
| Answer» B. n<sup>2</sup> nodes | |