Timeline for What is the independence number of hamming graph?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 11, 2013 at 10:17 | comment | added | Nick Gill | @Carlo, I think you edited your answer at the same time as I wrote mine... So they've got basically the same content! | |
| Sep 11, 2013 at 9:59 | comment | added | Saravanan | Ofcourse, In hamming graph, what I asked for, two vertices are adjacent if their hamming distance is 1. But in Hq(n,d) vertices are adjacent if their hamming distance is larger or equal to d. | |
| Sep 11, 2013 at 9:51 | comment | added | Carlo Beenakker | I added the definition of Hamming graph from coding theory, which my answer addressed. I guess there's more than one "Hamming graph"? | |
| Sep 11, 2013 at 9:49 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
added definition
|
| Sep 11, 2013 at 8:51 | comment | added | Saravanan | Hq(n; d), has as vertices all the q-ary sequences of length n, and two vertices are adjacent if their Hamming distance is larger or equal to d. So it will not represent classical hamming graph as q=2. | |
| Sep 11, 2013 at 8:45 | comment | added | Saravanan | Thank u carlo, but there is no any exact answer for this, am i right? | |
| Sep 11, 2013 at 8:45 | comment | added | Dima Pasechnik | What is $H_q(n,d)$ ? Classically, $H(n,d)$ is the graph on $n$-tuples of words in the alphabet of size $d$, with adjacency being having Hamming distance 1. And why $q=2$? Do you mean $q=1$? | |
| Sep 11, 2013 at 8:43 | history | edited | Carlo Beenakker | CC BY-SA 3.0 |
reference
|
| Sep 11, 2013 at 8:33 | history | answered | Carlo Beenakker | CC BY-SA 3.0 |