On distance graphs in rational spaces

From MaRDI portal
Publication:6098044




Abstract: For any positive definite rational quadratic form q of n variables let G(mathbbQn,q) denote the graph with vertices mathbbQn and x,yinmathbbQn connected iff q(xy)=1. This notion generalises standard Euclidean distance graphs. In this article we study these graphs and show how to find the exact value of clique number of the G(mathbbQn,q). We also prove rational analogue of the Beckman--Quarles theorem that any unit-preserving mapping of mathbbQn is an isometry.









This page was built for publication: On distance graphs in rational spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098044)