Timeline for Domination number of hamming graphs
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2 at 10:17 | comment | added | Kolja Knauer | Already for the hypercube $H(p,2)$ determining the domination number remains opens, see this paper | |
| Mar 5, 2014 at 15:31 | history | edited | Felix Goldberg |
edited tags
|
|
| Mar 28, 2011 at 3:28 | comment | added | Orange | Well to state the obvious the domination numbers of H(1,n) the complete graph, and H(2,n) the rook's graph are easy. You've pretty much done H(3,n). Try H(4,n). Wish I could be of more help, I'm mostly commenting to draw attention to the problem since I'm also curious. | |
| Mar 5, 2011 at 8:27 | history | asked | Jineon Baek | CC BY-SA 2.5 |