Fullerenes via their automorphism groups (Q2853166)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fullerenes via their automorphism groups |
scientific article; zbMATH DE number 6217123
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fullerenes via their automorphism groups |
scientific article; zbMATH DE number 6217123 |
Statements
18 October 2013
0 references
semiregular automorphisms
0 references
Fullerenes via their automorphism groups (English)
0 references
A fullerene graph (in short a fullerene) is a 3-connected cubic planar graph all of whose faces are pentagons and hexagons. A semiregular element of a permutation group is a non-identity element having all cycles of equal length in its cycle decomposition. The existence of semiregular automorphisms in fullerenes is discussed. In particular, the family of fullerene graphs is described via the existence of semiregular automorphisms in their automorphism groups.
0 references
