On the sphericity of the graphs of semiregular polyhedra (Q1076032)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the sphericity of the graphs of semiregular polyhedra |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the sphericity of the graphs of semiregular polyhedra |
scientific article |
Statements
On the sphericity of the graphs of semiregular polyhedra (English)
0 references
1986
0 references
The sphericity of a graph \(G\) is the smallest integer n such that the nodes of \(G\) can be embedded in \(E^ n\) in such a way that the Euclidean distance of a pair of nodes is smaller than 1 if and only if the nodes are adjacent in \(G\). Except for a few prisms, the author determines the sphericity of the graphs of semiregular polyhedra in \(E^ 3\).
0 references
graph embedding
0 references
sphericity
0 references
graphs of semiregular polyhedra
0 references
