Abstract
In this paper a method is suggested for naming any convex polyhedron by a numerical code arising from the adjacency matrix of its edge graph. A polyhedron is uniquely fixed by its name and can be built using it. Classes of convexn-acra (i.e.n-vertex polyhedra) are strictly ordered by their names.
Publisher
International Union of Crystallography (IUCr)
Subject
Inorganic Chemistry,Physical and Theoretical Chemistry,Condensed Matter Physics,General Materials Science,Biochemistry,Structural Biology
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Symmetry Point Groups and Topological Entropies of Polyatomic Convex Clusters;Springer Proceedings in Earth and Environmental Sciences;2019-04-24
2. The Rome de Lisle problem;Acta Crystallographica Section A Foundations and Advances;2017-09-13
3. Accelerated scattering of convex polyhedra;Acta Crystallographica Section A Foundations and Advances;2017-08-15
4. Convex polyhedra with minimum and maximum names;Acta Crystallographica Section A Foundations and Advances;2017-04-20
5. Ordering of convex polyhedra and the Fedorov algorithm;Acta Crystallographica Section A Foundations and Advances;2017-01-01