2004/08/18 by Erwin Lijnen, Arnout Ceulemans · 1 citation
Computer Science · Materials Science · Mathematics · #Algorithm #Carbon Nanotubes in Composites #Combinatorics #Computer science #Curvature #Geometry #Graph #Graphene research and applications #Interconnection Networks and Systems #Mathematics #Symmetry (geometry)
paper · doi:10.1021/ci049865c
openalex publication_date 2004/08/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/17
We discuss a method to derive all symmetry-distinct oriented 2-cell embeddings of a given graph and classify them based on their symmetry. As an example, we apply the algorithm to the highly symmetrical trivalent Möbius-Kantor graph. Considering the derived 2-cell embeddings as carbon networks leads to some interesting negative curvature carbon allotropes.