Newman, M. (2006), 'Finding community structure in networks using the eigenvectors of matrices', Physical Review E 74 , 36104 .
Chung, F. R. K. (1997), Spectral Graph Theory , American Mathematical Society .
Monien, B. (2001), 'On Spectral Bounds for the k-Partitioning of Graphs' .
Mohar, B. (1991), 'The Laplacian spectrum of graphs', Graph Theory, Combinatorics, and Applications 2 , 871--898 .
Spielman, D. (2007), 'Spectral Graph Theory and its Applications', Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on , 29-38 .
Johnson, D. S. & Papadimitriou, C. H. (1988), 'On generating all maximal independent sets', Inf. Process. Lett. 27 , 119--123 .
Dias, V. M.; de Figueiredo, C. M. & Szwarcfiter, J. L. (2005), 'Generating bicliques of a graph in lexicographic order', Theoretical Computer Science 337 , 240 - 248 .
Fiedler, M. (1975), 'A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory', Czechoslovak Mathematical Journal 25 , 619--633 .
Haveliwala, T. & Kamvar, S. (2003), 'The second eigenvalue of the Google matrix', A Stanford University Technical Report http://dbpubs. stanford. edu .
Dhillon, I. S. (2001), Co-clustering documents and words using bipartite spectral graph partitioning, in 'KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining' , ACM Press, New York, NY, USA , pp. 269--274 .
Blelloch, G. (2002), 'Graph Separators' .
Pothen, A.; Simon, H. & Liou, K. (1990), 'Partitioning Sparse Matrices with Eigenvectors of Graphs', SIAM J. MATRIX ANAL. APPLIC. 11 , 430--452 .
Chan, P. K.; Schlag, M. D. F. & Zien, J. Y. (1994), 'Spectral K-way ratio-cut partitioning and clustering.', IEEE Trans. on CAD of Integrated Circuits and Systems 13 , 1088-1096 .
Yu, S. X. & Shi, J. (2003), Multiclass Spectral Clustering, in 'Proc. International Conference on Computer Vision (ICCV 03)' .
Hagen, L. W. & Kahng, A. B. (1992), 'New spectral methods for ratio cut partitioning and clustering.', IEEE Trans. on CAD of Integrated Circuits and Systems 11 , 1074-1085 .
Symeonidis, P.; Nanopoulos, A. & Manolopoulos, Y. (2008), Tag recommendations based on tensor dimensionality reduction, in 'RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems' , ACM, New York, NY, USA , pp. 43--50 .
Ranade, A. (2000), 'Some uses of spectral methods' .
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006), Content Aggregation on Knowledge Bases using Graph Clustering, in York Sure & John Domingue, ed., 'The Semantic Web: Research and Applications' , Springer, Heidelberg , pp. 530-544 .
Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D. (2007), On Finding Graph Clusterings with Maximum Modularity, in Andreas Brandstädt; Dieter Kratsch & Haiko Müller, ed., 'Graph-Theoretic Concepts in Computer Science' , Springer, Berlin / Heidelberg , pp. 121-132 .
Diestel, R. (2005), Graph Theory , Springer-Verlag Heidelberg, New York .