Abstract: We describe a new construction algorithm for the recursive generation of all non-isomorphic IPR fullerenes. Unlike previous algorithms, the new algorithm stays entirely within the class of IPR fullerenes, that is: every IPR fullerene is constructed by expanding a smaller IPR fullerene unless it belongs to limited class of irreducible IPR fullerenes that can easily be made separately. The class of irreducible IPR fullerenes consists of 36 fullerenes with up to 112 vertices and 4 infinite families of nanotube fullerenes. Our implementation of this algorithm is faster than other generators for IPR fullerenes and we used it to compute all IPR fullerenes up to 400 vertices.
Recommendations
Cites work
- scientific article; zbMATH DE number 50175 (Why is no real title available?)
- A constructive enumeration of nanotube caps
- Boundary uniqueness of fusenes
- Fast generation of planar graphs
- Fullerenes with distant pentagons
- Generation of cubic graphs
- House of Graphs: a database of interesting graphs
- Isomorph-Free Exhaustive Generation
- Numbers of faces and boundary encodings of patches
- Numbers of faces in disordered patches
- Pentagon-hexagon-patches with short boundaries
- The boundary and the shape of binary images
Cited in
(7)- On correlation of hyperbolic volumes of fullerenes with their properties
- Reducing an arbitrary fullerene to the dodecahedron
- The Fedorov algorithm revised
- scientific article; zbMATH DE number 1522752 (Why is no real title available?)
- PI, Szeged and revised Szeged indices of IPR fullerenes
- Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
- Exact square coloring of subcubic planar graphs
This page was built for publication: Recursive generation of IPR fullerenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498482)
