Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T18:18:05.601Z Has data issue: false hasContentIssue false

On Single-Distance Graphs on the Rational Points in Euclidean Spaces

Published online by Cambridge University Press:  29 July 2020

Sheng Bau
Affiliation:
School of Mathematics, Statistics and Computer Science, University of Kwazulu-Natal, Durban, South Africa e-mail: baus@ukzn.ac.za
Peter Johnson
Affiliation:
Department of Mathematics and Statistics, Auburn University, Auburn, Alabama e-mail: johnspd@auburn.edu
Matt Noble*
Affiliation:
Department of Mathematics and Statistics, Middle Georgia State University, Macon, Georgia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For positive integers n and d > 0, let $G(\mathbb {Q}^n,\; d)$ denote the graph whose vertices are the set of rational points $\mathbb {Q}^n$, with $u,v \in \mathbb {Q}^n$ being adjacent if and only if the Euclidean distance between u and v is equal to d. Such a graph is deemed “non-trivial” if d is actually realized as a distance between points of $\mathbb {Q}^n$. In this paper, we show that a space $\mathbb {Q}^n$ has the property that all pairs of non-trivial distance graphs $G(\mathbb {Q}^n,\; d_1)$ and $G(\mathbb {Q}^n,\; d_2)$ are isomorphic if and only if n is equal to 1, 2, or a multiple of 4. Along the way, we make a number of observations concerning the clique number of $G(\mathbb {Q}^n,\; d)$.

Information

Type
Article
Copyright
© Canadian Mathematical Society 2020