An efficient algorithm for computing permanental polynomials of graphs |
| |
Authors: | Yan Huo Fengshan Bai |
| |
Affiliation: | Department of Mathematical Sciences, Tsinghua University, Beijing 100084, PR China |
| |
Abstract: | 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 C56, while the largest fullerene computed before is C40. Extensive numerical computations show that the algorithm is fast and stable. |
| |
Keywords: | 02.10.Ox 02.60.Dc 81.05.Tp |
本文献已被 ScienceDirect 等数据库收录! |
|