On the connectedness of some geometric graphs (Q804592): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unit-distance graphs in rational n-spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259107 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coloring abelian groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distances realized by sets covering the plane / rank | |||
Normal rank |
Latest revision as of 17:16, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the connectedness of some geometric graphs |
scientific article |
Statements
On the connectedness of some geometric graphs (English)
0 references
1990
0 references
Let \(S\subseteq R\). Then by \(G(S^ d)\) we denote a graph whose vertices are all the points of the real space \(R^ d\) with their coordinates in S and two vertices are connected by an edge if their distance is 1. In the paper it is proved that G(Q(\(\sqrt{k})^ d)\) is connected for all \(k\in N\), \(d\geq 5\); G(Q(\(\sqrt{k})^ 2)\) has countably infinitely many connected components for \(k=1,2,3,5,6(mod 8)\), and that for every algebraic number a, \(G(Q(a)^ d)\) is a connected graph for every large d.
0 references
connectivity
0 references
geometric graph
0 references