Fast partial-differential synthesis of the matching polynomial of C72-100.
The Thesis algorithm uses partial-differential edge operators and a grammatical structure to generate and avoid expanding the Matching Polynomial. To run the algorithm efficiently, the vertexes of fullerene graphs C60-100 were sorted into three-dimensional sectors.
Salvador
J M
JM
Department of Chemistry, University of Texas at El Paso 79968, USA.
Hernandez
A
A
Beltran
A
A
Duran
R
R
Mactutis
A
A
D000465:Algorithms