4-regular and self-dual analogs of fullerenes
Mathieu Dutour Sikiric, Michel Deza

TL;DR
This paper surveys properties of 4-regular plane graphs called i-hedrites, introduces algorithms for their enumeration, explores their symmetry groups, and extends these concepts to self-dual analogs with applications in knot theory.
Contribution
It presents new algorithms for enumerating i-hedrites and 4-self-hedrites, classifies their symmetry groups, and links these graphs to knot theory and Goldberg-Coxeter constructions.
Findings
Enumerated all i-hedrites and their symmetry groups.
Classified 4-self-hedrites with specific symmetries.
Established links between these graphs and knot theory.
Abstract
An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all i-hedrites and the minimal representative for each. We also review the link of 4-hedrites with knot theory and the classification of 4-hedrites with simple central circuits. An i-self-hedrite is a self-dual plane graph with faces and vertices of size/degree 2, 3 and 4. We give a new efficient algorithm for enumerating them based on i-hedrites. We give a classification of their possible symmetry groups and a classification of 4-self-hedrites of symmetry T, Td in terms of the Goldberg-Coxeter construction. Then we give a method for enumerating 4-self-hedrites with simple zigzags.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFullerene Chemistry and Applications · Carbon Nanotubes in Composites · Graphene research and applications
