1. Belardo, F., De Filippis, V., Simić, S.K.: Computing the permanental polynomial of a matrix from a combinatorial viewpoint. MATCH Commun. Math. Comput. Chem. 66, 381–396 (2011)
2. Borowiecki, M.: On spectrum and per-spectrum of graphs. Publ. Inst. Math. 38, 31–33 (1985)
3. Borowiecki, M., Jóźwiak, T.: A note on characteristic and permanental polynomials of multigraphs. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds.) Graph Theory, pp. 75–78. Springer, Berlin (1983) [Łagów, (1981)]
4. Borowiecki, M., Jóźwiak, T.: Computing the permanental polynomial of a multigraph. Discuss. Math. 5, 9–16 (1982)
5. Brenner, J.L., Brualdi, R.A.: Eigenschaften der permanentefunktion. Arch. Math. 18, 585–586 (1967)