Distances in a rigid unit-distance graph in the plane

Distances in a rigid unit-distance graph in the plane

0.00 Avg rating0 Votes
Article ID: iaor19912062
Country: Netherlands
Volume: 31
Issue: 2
Start Page Number: 193
End Page Number: 200
Publication Date: Apr 1991
Journal: Discrete Applied Mathematics
Authors:
Abstract:

It is proved that a number d>0 can appear as the Euclidean distance between two vertices in some ‘rigid’ unit-distance graph in the plane if and only if d is an algebraic number.

Reviews

Required fields are marked *. Your email address will not be published.