Oriented 2-Cell Embeddings of a Graph and Their Symmetry Classification: Generating Algorithms and Case Study of the Möbius-Kantor Graph
Erwin Lijnen, Arnout Jozef Ceulemans · Journal of Chemical Information and Computer Sciences · 2004
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.