Every graph is an integral distance graph in the plane (Q1374191): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jcta.1997.2826 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTA.1997.2826 / rank | |||
Normal rank | |||
Latest revision as of 18:59, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every graph is an integral distance graph in the plane |
scientific article |
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
