MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Chromatic Number Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The chromatic number of star graph with 3 vertices is greater than that of a tree with same number of vertices. |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
The chromatic number of star graph with 3 vertices is greater than that of a complete graph with 3 vertices. |
| A. | True |
| B. | False |
| Answer» C. | |
| 3. |
A graph with chromatic number less than or equal to k is called? |
| A. | K chromatic |
| B. | K colorable |
| C. | K chromatic colorable |
| D. | K colorable chromatic |
| Answer» C. K chromatic colorable | |
| 4. |
What will be the chromatic number for a tree having more than 1 vertex? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | Varies with the structure and number of vertices of the tree |
| Answer» D. Varies with the structure and number of vertices of the tree | |
| 5. |
What will be the chromatic number for a complete graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | n |
| D. | n! |
| Answer» D. n! | |
| 6. |
What will be the chromatic number for a line graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» E. | |
| 7. |
Calculating the chromatic number of a graph is a |
| A. | P problem |
| B. | NP hard problem |
| C. | NP complete problem |
| D. | cannot be identified as any of the given problem types |
| Answer» D. cannot be identified as any of the given problem types | |
| 8. |
What will be the chromatic number for an bipartite graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» D. n | |
| 9. |
What will be the chromatic number for an empty graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» C. 2 | |
| 10. |
What is a chromatic number? |
| A. | The maximum number of colors required for proper edge coloring of graph |
| B. | The maximum number of colors required for proper vertex coloring of graph |
| C. | The minimum number of colors required for proper vertex coloring of graph |
| D. | The minimum number of colors required for proper edge coloring of graph |
| Answer» D. The minimum number of colors required for proper edge coloring of graph | |
| 11. |
The number of colors used by a proper coloring graph is called? |
| A. | k coloring graph |
| B. | x coloring graph |
| C. | m coloring graph |
| D. | n coloring graph |
| Answer» B. x coloring graph | |
| 12. |
What is the condition for proper coloring of a graph? |
| A. | two vertices having a common edge should not have same color |
| B. | two vertices having a common edge should always have same color |
| C. | all vertices should have a different color |
| D. | all vertices should have same color |
| Answer» B. two vertices having a common edge should always have same color | |
| 13. |
What is the definition of graph according to graph theory? |
| A. | visual representation of data |
| B. | collection of dots and lines |
| C. | collection of edges |
| D. | collection of vertices |
| Answer» C. collection of edges | |