A scheme to construct distance-three codes using latin squares, with applications to the n-cube
References (6)
Approximating the minimum maximal independence number
Inform. Process. Lett.
(1993)- et al.
A survey of the theory of hypercube graphs
Comput. Math. Appl.
(1988) - et al.
Coding Theory: The Essentials
(1991)
There are more references available in the full text version of this article.
Cited by (9)
A comment on "the domination number of exchanged hypercubes"
2015, Information Processing LettersPerfect r -domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
2003, Information Processing LettersSmallest independent dominating sets in Kronecker products of cycles
2001, Discrete Applied MathematicsVertex-neighbor-integrity of magnifiers, expanders, and hypercubes
2000, Discrete MathematicsPerfect r-domination in the Kronecker product of three cycles
2002, IEEE Transactions on Circuits and Systems I: Fundamental Theory and ApplicationsA hierarchical structure of the quad-cube and the associated diameter, domination, and Hamiltonicity
2023, Discrete Mathematics, Algorithms and Applications
Copyright © 1995 Published by Elsevier B.V.