[1] W. N. Anderson, Jr., T. D. Morley: Eigenvalues of the Laplacian of a graph. TR 71-45, Univ. of Md., College Park, MD. Zbl 0594.05046

[2] N. Biggs: Algebraic Graph Theory. Cambridge Univ. Press, 1974. MR 0347649 | Zbl 0284.05101

[3] D. M. Cvetkovič M. Doob, H. Sachs: Spectra of Graphs. Academic Press, New York, 1980. MR 0572262

[4] A. K. Keľmans, V. M. Chelnokov: A certain polynomial of a graph and graphs with an extremal number of trees. J. Combinatorial Theory (B) 16 (1974), 197-214. Erratum, Ibid. 24 (1978), 375. DOI 10.1016/0095-8956(74)90065-3 | MR 0345867

[5] M. Fiedler: Algebraic connectivity of graphs. Czech. Math. J. 23 (98) (1973), 298 - 305. MR 0318007 | Zbl 0265.05119

[6] M. Marcus, H. Minc: A Survey of Matrix Theory and Matrix Inequalities. Prindle, Weber and Schmidt, Boston, 1964. MR 0162808 | Zbl 0126.02404

[7] R. Merris K. R. Rebman, W. Watkins: Permanental polynomials of graphs. Letters in Linear Algebra, Linear Algebra Appl. 38 (1981), 273-288. DOI 10.1016/0024-3795(81)90026-4 | MR 0636042

[8] H. Poincaré: Second complément à l'analysis situs. Proc. London Math. Soc. 32 (1901), 277-308.

[9] I. Schur: Über endliche Gruppen und Hermitesche Formen. Math. Z. 1 (1918), 184-207. DOI 10.1007/BF01203611 | MR 1544291

[10] A. J. Schwenk: Almost all trees are cospectral, New Directions in Graph Theory. (edited by F. Harary), Academic Press, 1973. MR 0384582