Voytekhovsky Yury L
Geological Institute of the Kola Science Centre, Russian Academy of Sciences, 14 Fersman Street, Apatity, Murmansk Region 184209, Russian Federation.
Acta Crystallogr A Found Adv. 2017 Jan 1;73(Pt 1):77-80. doi: 10.1107/S2053273316017095.
A method of naming any convex polyhedron by a numerical code arising from the adjacency matrix of its edge graph has been previously suggested. A polyhedron can be built using its name. Classes of convex n-acra (i.e. n-vertex polyhedra) are strictly (without overlapping) ordered by their names. In this paper the relationship between the Fedorov algorithm to generate the whole combinatorial variety of convex polyhedra and the above ordering is described. The convex n-acra are weakly ordered by the maximum extra valencies of their vertices. Thus, non-simple n-acra follow the simple ones for any n.
之前有人提出了一种通过由其边图的邻接矩阵产生的数字代码来命名任何凸多面体的方法。可以使用其名称构建一个多面体。凸n面体（即n顶点多面体）的类别按其名称严格（无重叠）排序。本文描述了用于生成凸多面体的整个组合种类的费多罗夫算法与上述排序之间的关系。凸n面体按其顶点的最大额外价数弱排序。因此，对于任何n，非简单n面体排在简单n面体之后。
