Abstract
A fast computer algorithm is described which brings computation of the permanents of sparse matrices, specifically, chemical adjacency matrices, within the reach of a desktop computer. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekulé structure count. Also presented is a C-language implementation which was deliberately written for ease of translation into other high-level languages.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
H. Minc, in:Encyclopedia of Mathematics and Its Applications, Vol. 6, ed. G.-C. Rota (Addison-Wesley, Reading, MA, 1978) pp. 1–119.
N. Trinajstić,Chemical Graph Theory, 2nd Ed. (CRC, Boca Raton, FL, 1993) pp. 167–168;
D. M. Cvetković, I. Gutman and N. Trinajstić, Chem. Phys. Lett. 16 (1972) 614;
J.K. Percus, J. Math. Phys. 10 (1969)1881.
D.J. Klein and X. Liu, J. Comput. Chem. 12 (1991) 1260.
P.W. Kasteleyn, J. Math. Phys. 4 (1963) 287;
P.W. Kasteleyn, in: Graph Theory and Theoretical Physics, ed. F. Harary (Academic Press, New York, 1967) chap. 2.
B.W. Kernighan and D.M. Ritchie, The C Programming Language, 2nd Ed. (Prentice-Hall, Englewood Cliffs, NJ, 1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cash, G.G. A fast computer algorithm for finding the permanent of adjacency matrices. J Math Chem 18, 115–119 (1995). https://doi.org/10.1007/BF01164652
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01164652