Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Voytekhovsky (2016)
How to name and order convex polyhedra.Acta crystallographica. Section A, Foundations and advances, 72 Pt 5
Y. Voytekhovsky (2001)
The Fedorov algorithm revised.Acta crystallographica. Section A, Foundations of crystallography, 57 Pt 4
Fedorov (1893)
241Proc. R. Miner. Soc. St Petersburg, 30
Y. Voytekhovsky (2014)
E. S. Fedorov’s algorithm of the generation of the combinatorial diversity of convex polyhedra: The latest results and applicationsJournal of Structural Chemistry, 55
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.
Acta Crystallographica Section A Foundations of Crystallography – Wiley
Published: Jan 1, 2017
Keywords: ; ; ; ;
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.