edited by
0 0 votes

Consider the cube shown below with its $8$ corners labelled $\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}, \mathrm{e}, \mathrm{f}, \mathrm{g}$, and $\text{h}.$ The figure is representative. All corners are to be colored such that any two corners that are connected by an edge must be of different colors. The minimum number of colors required to achieve this is $\_\_\_\_$

  1. $8$
  2. $4$
  3. $3$
  4. $2$

1 Answer

0 0 votes

The conept That  is used to solve this  question is  (colouring of Graph )  in Discerete Mathematics . 

we start  colouring with most crowded region . 

R = Red Colour 

G  = Green Colour.

So option D is correct. 

Answer:
Position:
Show: