Isomorphisms of unit distance graphs of layers
Arthur Igorevich Bikeev

TL;DR
This paper investigates the isomorphism classes of unit distance graphs of layered Euclidean spaces, proving they are uniquely determined by layer width and that automorphisms are isometries, extending classical geometric theorems.
Contribution
It establishes that unit distance graphs of different layers are non-isomorphic and that automorphisms of these graphs are isometries, generalizing known results to higher dimensions.
Findings
Unit distance graphs of different layers are non-isomorphic.
Automorphisms of these graphs are isometries.
Results extend classical theorems like Beckman-Quarles to layered spaces.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Structural Analysis and Optimization
