Abstract
A simple and effective approach for the enumeration of fullerene structures is proposed. The method combines the formalism of a fullerene graph cut-and-unfold onto a planar triangular lattice and a topological description of closed quasi-2D clusters. A tabulation of possible fullerene graphs Cn is given for the number of atoms 20 < or = n < or = 150.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of chemical information and computer sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
