Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
