A special antidilation problem for meshes and Hamming graphs

The antidilation problem consists of a mapping from the set of vertices of the guest graph G into the set of vertices of the host graph H such that distance of images of adjacent vertices of G is maximized in H . This is a dual problem to the well known dilation problem. In this paper, we study an interesting special case of the antidilation problem when the guest and host graphs are the same. We prove exact results for d -dimensional meshes, tori and Hamming graphs. In all three cases, the antidilation is very close to radius ( H ) , which is a desired property. As a consequence we solve an open problem of Lagarias about the antidilation of paths in d -dimensional meshes.