Distance-2 MDS codes and latin colorings in the Doob graphs
arXiv:1510.01429 · doi:10.1007/s00373-018-1926-4
Abstract
The maximum independent sets in the Doob graphs D(m,n) are analogs of the distance-2 MDS codes in Hamming graphs and of the latin hypercubes. We prove the characterization of these sets stating that every such set is semilinear or reducible. As related objects, we study vertex sets with maximum cut (edge boundary) in D(m,n) and prove some facts on their structure. We show that the considered two classes (the maximum independent sets and the maximum-cut sets) can be defined as classes of completely regular sets with specified 2-by-2 quotient matrices. It is notable that for a set from the considered classes, the eigenvalues of the quotient matrix are the maximum and the minimum eigenvalues of the graph. For D(m,0), we show the existence of a third, intermediate, class of completely regular sets with the same property.
arXiv commentv2: revised; accepted version
References in corpus (8)
- n-Ary quasigroups of order 4
- Asymptotics for the number of n-quasigroups of order 4
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4
- Arithmetic completely regular codes
- On reducibility of n-ary quasigroups
- MDS codes in the Doob graphs
- On the number of maximum independent sets in Doob graphs