Fast Partial-Differential Synthesis of the Matching Polynomial of C72-100

Authors:

Abstract
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.