1997
DOI: 10.1006/jagm.1996.0806
|View full text |Cite
|
Sign up to set email alerts
|

A Constructive Enumeration of Fullerenes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
121
0
1

Year Published

1997
1997
2017
2017

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 132 publications
(123 citation statements)
references
References 3 publications
1
121
0
1
Order By: Relevance
“…Calculations implementing the rules embodied in Tables I and II were carried out for various sets of graphs. Generators geng (part of the nauty software written by B. D. McKay and available at http://cs.anu.edu.au/~bdm/), plantri, 35 CaGe, 36 fullgen, 37 and our own ad hoc programs were used to construct general families of graphs.…”
Section: A Statistics Of Conduction Of Molecular Graphsmentioning
confidence: 99%
“…Calculations implementing the rules embodied in Tables I and II were carried out for various sets of graphs. Generators geng (part of the nauty software written by B. D. McKay and available at http://cs.anu.edu.au/~bdm/), plantri, 35 CaGe, 36 fullgen, 37 and our own ad hoc programs were used to construct general families of graphs.…”
Section: A Statistics Of Conduction Of Molecular Graphsmentioning
confidence: 99%
“…Polyhedra in general can be built from successive additions of polygons in spiral patterns [7,16] and this spiral algorithm was implemented in the program bspiral. Not all sequences of polygons Figure 2.…”
Section: Spiral Algorithmmentioning
confidence: 99%
“…Considerable effort has gone into investigating the geometry of fullerene shells in the context of carbon chemistry [7,16]. Acknowledging the basic differences between C atoms and CA subunits, this work provides a platform for considering retroviral capsid geometry.…”
Section: Diversity Of Closed Polyhedramentioning
confidence: 99%
“…[6]) that a top-down Divide&Conquer strategy allows to design an algorithm for fullerene enumeration which is absolutely reliable -that is, it guarantees complete lists -and simultaneously amazingly efficient: On an HP9000/735, a complete enumeration of e.g. all 0 60 -structures (of which there are 1812) needs about 12 seconds: 6.5 seconds for the generation of sufficiently many such structures and 5.5 seconds for testing structural isomorphism.…”
Section: Fullerene Structure Enumerationmentioning
confidence: 99%