An efficient algorithm for computing permanental polynomials of graphs

作者：Huo Yan; Liang Heng^*; Bai Fengshan

来源：Computer Physics Communications, 2006, 175(3): 196-203.

DOI：10.1016/j.cpc.2006.03.002

• permanental polynomial
• adjacency matrix
• graph
• fullerene
• FFT

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.

• 出版日期2006-8-1
• 单位清华大学