[1] ANDERSON W. N., MORLEY T. D.: Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra 18 (1985), 141-145. MR 0817657 | Zbl 0594.05046

[2] FIEDLER M.: Algebraic connectivity in graphs. Czechoslovak Math. J. 23(98) (1973). 298-305. MR 0318007

[3] MOHAR B.: The Laplacian spectrum of graphs. In: Graph Theory, Combinatorics, and Applications (Y. Alavi et al., eds.), J. Wiley, New York, 1991, pp. 871-898. MR 1170831 | Zbl 0840.05059

[4] MOHAR B., POLJAK S.: Eigenvalues in combinatorial optimization. Preprint 1992. MR 1240959

[5] POTHEN A., SIMON H. D., LIOU K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990), 430-452. MR 1054210 | Zbl 0711.65034

[6] SIMON H. D.: Partitioning of unstructured problems for parallel processing. Computing Sys. Eng. 2 (1991), 135-148.