Every graph is an integral distance graph in the plane (Q1374191)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1093103
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every graph is an integral distance graph in the plane |
scientific article; zbMATH DE number 1093103 |
Statements
Every graph is an integral distance graph in the plane (English)
0 references
12 March 1998
0 references
For a finite subset of the plane the pairs of points for which their euclidean distance is an integer defines the corresponding integral distance graph. It is shown that every finite simple graph may be represented in such a way.
0 references
euclidean plane
0 references
integral distance graph oscillators
0 references
0.8167272806167603
0 references
0.8154871463775635
0 references
