A constructive enumeration of nanotube caps

DOI10.1016/S0166-218X(00)00328-0MaRDI QIDQ5957298zbMATH OpenFDO

Authors Gunnar Brinkmann, U. von Nathusius, A. H. R. Palser

Publication date 19 June 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(00)00328-0

zbMATH Keywords

algorithmcapsfullereneisomorphismnanotubeplanar graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cited in

(12)

• Pentagon-hexagon-patches with short boundaries
• Generating carbon nanotube caps of almost all chiralities, using six molecular segment types
• Sizes of pentagonal clusters in fullerenes
• Counting hexagonal patches and independent sets in circle graphs
• Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
• Recursive generation of IPR fullerenes
• Hamiltonicity of cubic planar graphs with bounded face sizes
• A computer-assisted proof of the Barnette-Goodey conjecture: not only fullerene graphs are Hamiltonian
• Classification and generation of nanocones
• Clar covers and Zhang-Zhang polynomials of zigzag and armchair carbon nanotubes
• The AVD-total chromatic number of fullerene molecular graphs
• On the existence of nanojoins with given parameters

This page was built for publication: A constructive enumeration of nanotube caps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957298)