

MCQOPTIONS
Saved Bookmarks
This section includes 9 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. |
A non-planar graph can have ____________ |
A. | complete graph |
B. | subgraph |
C. | line graph |
D. | bar graph |
Answer» C. line graph | |
2. |
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 | |
3. |
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)4>=mn |
B. | m≤5/3(n−2) |
C. | (m2+n)/3 |
D. | n>=(6/5)(n+1) |
Answer» C. (m2+n)/3 | |
4. |
For a connected planar simple graph G=(V, E) with e=|E|=16 and v=|V|=9, then find the number of regions that are created when drawing a planar representation of the graph? |
A. | 321 |
B. | 9 |
C. | 1024 |
D. | 596 |
Answer» C. 1024 | |
5. |
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. | |
6. |
Determine the density of a planar graph with 34 edges and 13 nodes. |
A. | 22/21 |
B. | 12/23 |
C. | 328 |
D. | 576 |
Answer» B. 12/23 | |
7. |
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 | |
8. |
If a graph G is k-colorable and k |
A. | n-colorable |
B. | n2 nodes |
C. | (k+n)-colorable |
D. | (k3+n3+1) nodes |
Answer» B. n2 nodes | |
9. |
The chromatic number of a graph is the property of ____________ |
A. | graph coloring |
B. | graph ordering |
C. | group ordering |
D. | group coloring |
Answer» C. group ordering | |