An efficient algorithm for computing permanental polynomials of graphs
An efficient numerical method for computing permanental polynomials of graphs is proposed. It adapts multi-entry expansion of FFT, and is parallel in nature. It is applied to fullerene-type graphs, and works for C-56, while the largest fullerene computed before is C-40. Extensive numerical computations show that the algorithm is fast and stable. (C) 2006 Elsevier B.V. All rights reserved.
permanental polynomial graph fft fullerene adjacency matrix