A characterization in Z^ n of finite unit-distance graphs in R^ n
A unit-distance graph in \(\mathbb{R}^ n\) is a graph with a subset of \(\mathbb{R}^ n\) as the vertex set and two vertices adjacent only if their Euclidean distance is 1. It is shown that a finite graph \(G\) on \(m\) vertices is isomorhpic to a unit-distance graph in \(\mathbb{R}^ n\) if and only if there exists a real number \(\lambda\) and for arbitrarily large integers \(r\) the graph \(G\) can be drawn in the \(n\)-dimensional integer lattice \(\mathbb{Z}^ n\) such that (i) the distance between every pair of vertices is at least \(\lambda r\), and (ii) adjacent vertices have their distance in the closed interval \([r- g(r), r+ g(r)]\) with \(g(r)= 2\sqrt n/r^{1/nm}\). In the case of the Euclidean plane two variations of this result are proved.
- On diversity and stability of unit bases for the Euclidean metric
- Unit-distance graphs in rational n-spaces
- Note on induced subgraphs of the unit distance graph \(E^ n\)
- Distances in a rigid unit-distance graph in the plane
- Unit-distance graphs, graphs on the integer lattice and a Ramsey type result
- On the connectivity of unit distance graphs
- Subdividing a graph toward a unit-distance graph in the plane
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\)
- Minimal graphs with respect to geometric distance realizability
- Two notions of unit distance graphs
- Unit ball graphs on geodesic spaces
- On the maximum number of unit edges in \(K_{m,n}\)
- On the strongly regular unit distance graphs
- All generalized Petersen graphs are unit-distance graphs
- Fast recognition of planar non unit distance graphs
- scientific article; zbMATH DE number 4142077 (Why is no real title available?)
- scientific article; zbMATH DE number 2145238 (Why is no real title available?)
- scientific article; zbMATH DE number 866045 (Why is no real title available?)
- Answer to an isomorphism problem in \(\mathbb{Z}^2\)
- Connectedness of unit distance subgraphs induced by closed convex sets
- Two notions of unit distance graphs
- On some non-rigid unit distance patterns
- Planar unit-distance graphs having planar unit-distance complement
This page was built for publication: A characterization in \(\mathbb{Z}^ n\) of finite unit-distance graphs in \(\mathbb{R}^ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322002)
