Newman, MEJ. Finding community structure in networks using the eigenvectors of matrices. In Physical Review E, (74) 3: 36104, APS, Year 2006.

Chung, F. R. K.. Spectral Graph Theory. American Mathematical Society, Year 1997.

Monien, B.. On Spectral Bounds for the k-Partitioning of Graphs. Year 2001.

Mohar, B.. The Laplacian spectrum of graphs. In Graph Theory, Combinatorics, and Applications, (2) 871--898, New York: Wiley, Year 1991.

Spielman, D.A.. Spectral Graph Theory and its Applications. In Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on, 29-38, Year 2007.

Johnson, David S. and Papadimitriou, Christos H.. On generating all maximal independent sets. In Inf. Process. Lett., (27) 3: 119--123, Elsevier North-Holland, Inc., Amsterdam, The Netherlands, The Netherlands, Year 1988.

Dias, Vânia M.F. and de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L.. Generating bicliques of a graph in lexicographic order. In Theoretical Computer Science, (337) 1-3: 240 - 248, Year 2005.

Fiedler, M.. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. In Czechoslovak Mathematical Journal, (25) 100: 619--633, Year 1975.

Haveliwala, T.H. and Kamvar, S.D.. The second eigenvalue of the Google matrix. In A Stanford University Technical Report http://dbpubs. stanford. edu, Year 2003.

Dhillon, Inderjit S.. Co-clustering documents and words using bipartite spectral graph partitioning. KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. 269--274, ACM Press, New York, NY, USA, Year 2001.

Blelloch, Guy. Graph Separators. Year 2002.

Pothen, A. and Simon, H.D. and Liou, K.P.. Partitioning Sparse Matrices with Eigenvectors of Graphs. In SIAM J. MATRIX ANAL. APPLIC., (11) 3: 430--452, Year 1990.

Chan, Pak K. and Schlag, Martine D. F. and Zien, Jason Y.. Spectral K-way ratio-cut partitioning and clustering.. In IEEE Trans. on CAD of Integrated Circuits and Systems, (13) 9: 1088-1096, Year 1994.

Yu, Stella X. and Shi, Jianbo. Multiclass Spectral Clustering. Proc. International Conference on Computer Vision (ICCV 03). Nice, France, Year 2003.

Hagen, Lars W. and Kahng, Andrew B.. New spectral methods for ratio cut partitioning and clustering.. In IEEE Trans. on CAD of Integrated Circuits and Systems, (11) 9: 1074-1085, Year 1992.

Symeonidis, Panagiotis and Nanopoulos, Alexandros and Manolopoulos, Yannis. Tag recommendations based on tensor dimensionality reduction. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems. 43--50, ACM, New York, NY, USA, Year 2008.

Ranade, A.G.. Some uses of spectral methods. Year 2000.

Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd. Content Aggregation on Knowledge Bases using Graph Clustering. The Semantic Web: Research and Applications. editor(s) Sure, York and Domingue, John. LNAI, (4011) 530-544, Springer, Heidelberg, Year 2006.

Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea. On Finding Graph Clusterings with Maximum Modularity. Graph-Theoretic Concepts in Computer Science. editor(s) Brandstädt, Andreas and Kratsch, Dieter and Müller, Haiko. Lecture Notes in Computer Science, (4769) 121-132, Springer, Berlin / Heidelberg, Year 2007.

Diestel, Reinhard. Graph Theory. I-XVI, 1-344, Springer-Verlag Heidelberg, New York, Year 2005.