# GATE | GATE IT 2006 | Question 25

• Last Updated : 16 Sep, 2021

Consider the undirected graph G defined as follows. The vertices of G are bit strings of length n. We have an edge between vertex u and vertex v if and only if u and v differ in exactly one bit position (in other words, v can be obtained from u by flipping a single bit). The ratio of the chromatic number of G to the diameter of G is
(A) 1/(2n-a)
(B) 1/n
(C) 2/n
(D) 3/n

Explanation:

Bipartite graph:- A bipartite graph is a graph G(V,E) where vertices can be decomposed into two disjoint sets such that no two vertices within the same set are adjacent.

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

Diameter of a graph:- The longest shortest path in between any two vertices of a graph The given graph is a bipartite graph => chromatic number is equals to 2 The diameter of graph is equals to n because at most we need to traverse n-1 edges.

The ratio = 2/n

This solution is contributed by Anil Saikrishna Devarasetty

My Personal Notes arrow_drop_up