First time here? Checkout the FAQ!
+5 votes

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

  1. 1/(2n-1)
  2. 1/n
  3. 2/n
  4. 3/n
asked in Graph Theory by Veteran (18.3k points)   | 510 views

3 Answers

+10 votes
Best answer

Answer is (C)

For the given condition we can simply design a K-MAP and mark an edge between every two adjacent cells in K-Map.(adjacency has to seen just as we do for minimization )

That will give us a Bipartite graph. chromatic number for this =2

Also from the same we can conclude that we need ,for a 'n' bit string, to traverse NO MORE than (n-1) edges or 'n' vertices to get a path b/w two arbitrary points.

So ratio is 2/n.

The given graph is actually hypercubegraph.

See problem 4 here:

answered by Boss (7.1k points)  
edited by

for traversing from 000. . .0   ⟶  111. . .1   , we require to traverse atleast 'n' edges.

How to find diameyer of the graph ?
+2 votes
answer C
answered by Veteran (13.2k points)  
+2 votes
answered by Veteran (19.2k points)  
Top Users Jan 2017
  1. Debashish Deka

    8608 Points

  2. sudsho

    5398 Points

  3. Habibkhan

    4718 Points

  4. Bikram

    4522 Points

  5. Vijay Thakur

    4468 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4122 Points

  8. santhoshdevulapally

    3742 Points

  9. Sushant Gokhale

    3576 Points

  10. GateSet

    3394 Points

Monthly Topper: Rs. 500 gift card

19,177 questions
24,073 answers
20,310 users