Isomorphisms of unit distance graphs of layers
Abstract
For any , consider the metric spaces in the Euclidean plane named layers or strips. B. Baslaugh in 1998 found the minimal width of a layer such that its unit distance graph contains a cycle of a given odd length . The first of the main results of this paper is the fact that the unit distance graphs of two layers are non-isomorphic for any different values . We also get a multidimensional analogue of this theorem. For given , we say that the metric space on with the metric space distance generated by -norm in is a layer . We show that the unit distance graphs of layers are non-isomorphic for . The third main result of this paper is the theorem that, for , any automorphism of the unit distance graph of layer is an isometry. This is related to the Beckman-Quarles theorem of 1953, which states that any unit-preserving mapping of is an isometry, and to the rational analogue of this theorem obtained by A. Sokolov in 2023.
Cite
@article{arxiv.2505.07799,
title = {Isomorphisms of unit distance graphs of layers},
author = {Arthur Igorevich Bikeev},
journal= {arXiv preprint arXiv:2505.07799},
year = {2025}
}