On the domatic number of the n-cube and a conjecture of Zelinka (French)
暂无分享,去创建一个
Recently Zelinka [6] proved that d ( Q n ), the domatic number of the n -cube, is for n equal 2 p − 1 or n equal 2 p , exactly 2 p . We show here how d ( Q n ) can be determined for the preceding values, in a very simple way. We then disprove a conjecture by Zelinka and replace it by another closely related to a former one, involving the domination number of the n -cube.
[1] Stephen T. Hedetniemi,et al. Towards a theory of domination in graphs , 1977, Networks.
[2] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[3] Bohdan Zelinka,et al. Domatic numbers of cube graphs , 1982 .