Sign Up to like & get
recommendations!
1
Published in 2018 at "Graphs and Combinatorics"
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…
read more here.
Keywords:
mds codes;
codes latin;
doob graphs;
distance mds ... See more keywords