πŸ“Š Discrete Mathematics
Q. 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/2101
  • (B) 1/50 c) 1/100
  • (C) d
  • (D) 1/20
πŸ’¬ Discuss
βœ… Correct Answer: (B) 1/50 c) 1/100

You must be Logged in to update hint/solution

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
983
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
87%
Success Rate