O'Keeffe Michael, Treacy Michael M J
School of Molecular Sciences, Arizona State University, Tempe, Arizona 85287, USA.
Department of Physics, Arizona State University, Tempe, Arizona 85287, USA.
Acta Crystallogr A Found Adv. 2022 Nov 1;78(Pt 6):498-506. doi: 10.1107/S2053273322008750. Epub 2022 Oct 21.
An nθ graph is an n-valent graph with two vertices. From symmetry considerations, it has vertex-edge transitivity 1 1. Here, they are considered extended with divalent vertices added to the edges to explore the simplest piecewise-linear tangled embeddings with straight, non-intersecting edges (sticks). The simplest tangles found are those with 3n sticks, transitivity 2 2, and with 2⌊(n - 1)/2⌋ ambient-anisotopic tangles. The simplest finite and 1-, 2- and 3-periodic decussate structures (links and tangles) are described. These include finite cubic and icosahedral and 1- and 3-periodic links, all with minimal transitivity. The paper also presents the simplest tangles of extended tetrahedra and their linkages to form periodic polycatenanes. A vertex- and edge-transitive embedding of a tangled srs net with tangled and polycatenated θ graphs and vertex-transitive tangled diamond (dia) nets are described.
nθ图是具有两个顶点的n价图。从对称性考虑,它具有顶点-边传递性1 1。在此,通过在边上添加二价顶点来对其进行扩展,以探索具有直的、不相交边(杆)的最简单分段线性缠结嵌入。找到的最简单缠结是那些具有3n根杆、传递性2 2且具有2⌊(n - 1)/2⌋个环境各向异性缠结的缠结。描述了最简单的有限以及1、2和3周期的交叉结构(链环和缠结)。这些包括有限立方和二十面体以及1和3周期链环,均具有最小传递性。本文还给出了扩展四面体的最简单缠结及其形成周期多链烷的连接方式。描述了具有缠结和多链化θ图的缠结srs网的顶点和边传递嵌入以及顶点传递缠结菱形(dia)网。