Multilattice graphs and perfect domination

Abstract: Perfect codes in the

n

-dimensio-nal grid

L a m b d a_{n}

of the lattice

m a t h b b Z^{n}

(

0 < n i n m a t h b b Z

) and its quotient toroidal grids were obtained via the truncated distance in

m a t h b b Z^{n}

given between

u = (u_{1}, c d o t s, u_{n})

and

v = (v_{1}, l d o t s, v_{n})

as the graph distance

h (u, v)

in

L a m b d a_{n}

, if

| u_{i} - v_{i} | l e 1

, for all

i i n 1, l d o t s, n

, and as

n + 1

, otherwise. Such codes are extended to multilattice graphs

G a m m a_{n}

obtained by glueing ternary

n

-cubes along their codimension 1 ternary subcubes in such a way that each binary

n

-subcube is contained in a unique maximal lattice of

G a m m a_{n}

. The existence of an infinite number of isolated perfect truncated-metric codes of radius 2 in

G a m m a_{n}

for

n = 2

is ascertained, leading to conjecture such existence for

n > 2

with radius

n

.

This page was built for publication: Multilattice graphs and perfect domination