Contact patterns of equal nonoverlapping spheres (Q1068097): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the dimension of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5824053 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5344631 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Embedding the n-cube in lower dimensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal f-trees and embedding spaces for molecular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Space graphs and sphericity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Closest Packing of Spherical Caps in <i>n</i> Dimensions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz? / rank | |||
Normal rank |
Latest revision as of 19:47, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Contact patterns of equal nonoverlapping spheres |
scientific article |
Statements
Contact patterns of equal nonoverlapping spheres (English)
0 references
1985
0 references
A contact pattern is defined as a graph with the vertex set corresponding to the set of nonoverlapping spheres in Euclidean space, where two vertices are adjacent when corresponding spheres touch each other. One can see that any finite graph G is a contact pattern in some n-space \(E^ n\). The question is to determine the contact dimension of a graph which is defined as the smallest n such that G is a contact pattern in \(E^ n\). In the article are presented the exact values of the contact dimension of complete multipartite graphs and cubes. There are proved some estimations for trees and other special classes of graphs.
0 references
dispersed set
0 references
contact pattern
0 references
contact dimension
0 references