An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?

An undirected graph G has bit strings of length 100 in its vertices an

1.	An undirected graph G has bit strings of length 100 in its vertices and there is an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position. Determine the ratio of the chromatic number of G to the diameter of G?
A.	1/2¹⁰¹
B.	1/50
C.	1/100
D.	1/20
Answer» C. 1/100