Day Maxwell Christopher, Hawthorne Frank Christopher, Rostami Ali
Department of Earth Sciences, University of Manitoba, Winnipeg, Manitoba R3T 2N2, Canada.
Computer Science Department, Friedrich Schiller University Jena, Jena, 07743, Germany.
Acta Crystallogr A Found Adv. 2024 May 1;80(Pt 3):258-281. doi: 10.1107/S2053273324002432. Epub 2024 Apr 29.
In Part I of this series, all topologically possible 1-periodic infinite graphs (chain graphs) representing chains of tetrahedra with up to 6-8 vertices (tetrahedra) per repeat unit were generated. This paper examines possible restraints on embedding these chain graphs into Euclidean space such that they are compatible with the metrics of chains of tetrahedra in observed crystal structures. Chain-silicate minerals with T = Si (plus P, V, As, Al, Fe, B, Be, Zn and Mg) have a grand nearest-neighbour ⟨T-T⟩ distance of 3.06±0.15 Å and a minimum T...T separation of 3.71 Å between non-nearest-neighbour tetrahedra, and in order for embedded chain graphs (called unit-distance graphs) to be possible atomic arrangements in crystals, they must conform to these metrics, a process termed equalization. It is shown that equalization of all acyclic chain graphs is possible in 2D and 3D, and that equalization of most cyclic chain graphs is possible in 3D but not necessarily in 2D. All unique ways in which non-isomorphic vertices may be moved are designated modes of geometric modification. If a mode (m) is applied to an equalized unit-distance graph such that a new geometrically distinct unit-distance graph is produced without changing the lengths of any edges, the mode is designated as valid (m); if a new geometrically distinct unit-distance graph cannot be produced, the mode is invalid (m). The parameters m and m are used to define ranges of rigidity of the unit-distance graphs, and are related to the edge-to-vertex ratio, e/n, of the parent chain graph. The program GraphT-T was developed to embed any chain graph into Euclidean space subject to the metric restraints on T-T and T...T. Embedding a selection of chain graphs with differing e/n ratios shows that the principal reason why many topologically possible chains cannot occur in crystal structures is due to violation of the requirement that T...T > 3.71 Å. Such a restraint becomes increasingly restrictive as e/n increases and indicates why chains with stoichiometry TO do not occur in crystal structures.
在本系列的第一部分中,生成了所有拓扑上可能的1周期无限图(链图),这些图表示每个重复单元最多有6 - 8个顶点(四面体)的四面体链。本文研究了将这些链图嵌入欧几里得空间的可能限制,使其与观察到的晶体结构中四面体链的度量兼容。以T = Si(加上P、V、As、Al、Fe、B、Be、Zn和Mg)的链状硅酸盐矿物,其最近邻⟨T - T⟩距离为3.06±0.15 Å,非最近邻四面体之间的最小T...T间距为3.71 Å,为了使嵌入的链图(称为单位距离图)成为晶体中可能的原子排列,它们必须符合这些度量,这一过程称为均衡化。结果表明,所有无环链图在二维和三维中都可以进行均衡化,并且大多数环状链图在三维中可以进行均衡化,但在二维中不一定能。非同构顶点可能移动的所有独特方式都被指定为几何修改模式。如果一种模式(m)应用于一个均衡化的单位距离图,使得在不改变任何边长度的情况下产生一个新的几何上不同的单位距离图,则该模式被指定为有效(m);如果不能产生新的几何上不同的单位距离图,则该模式无效(m)。参数m和m用于定义单位距离图的刚性范围,并且与母链图的边与顶点比e/n相关。开发了程序GraphT - T,以将任何链图嵌入到受T - T和T...T度量限制的欧几里得空间中。嵌入一系列具有不同e/n比的链图表明,许多拓扑上可能的链不能出现在晶体结构中的主要原因是违反了T...T > 3.71 Å的要求。随着e/n的增加,这种限制变得越来越严格,这也说明了化学计量比为TO的链为何不出现在晶体结构中。