MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Edge Coloring Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What will be the chromatic index for a complete graph having n vertices (consider n to be an even number)? |
| A. | n |
| B. | n + 1 |
| C. | n 1 |
| D. | 2n + 1 |
| Answer» D. 2n + 1 | |
| 2. |
What will be the chromatic index for a complete graph having n vertices (consider n to be an odd number)? |
| A. | n |
| B. | n + 1 |
| C. | n 1 |
| D. | 2n + 1 |
| Answer» B. n + 1 | |
| 3. |
Bipartite graph belongs to class 1 graphs. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
Chromatic number of line graph is always equal to the chromatic index of the graph. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
Calculating the chromatic index 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 | |
| 6. |
If chromatic number of a line graph is 4 then the chromatic index of the graph will be? |
| A. | 0 |
| B. | 1 |
| C. | 4 |
| D. | information insufficient |
| Answer» D. information insufficient | |
| 7. |
What will be the chromatic index for an empty graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» B. 1 | |
| 8. |
What is a chromatic index? |
| 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» E. | |
| 9. |
The number of colors used by a proper edge coloring graph is called? |
| A. | k edge coloring graph |
| B. | x edge coloring graph |
| C. | m edge coloring graph |
| D. | n edge coloring graph |
| Answer» B. x edge coloring graph | |
| 10. |
What is the condition for proper edge 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. | No two incident edges should have the same color |
| D. | No two incident edges should have different color |
| Answer» D. No two incident edges should have different color | |
| 11. |
In graph theory collection of dots and lines is called |
| A. | vertex |
| B. | edge |
| C. | graph |
| D. | map |
| Answer» D. map | |