Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems

Annals of Operations Research

Volumn 107, Issue 1-4, 2001, Pages 349-368

  Van Den Heuvel, Jan ^a   Pejić, Snežana ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Eigenvalues; Eigenvectors; Frequency assignment problem; Laplacian matrix; Span; Weighted graph

Indexed keywords

EID: 0035561101     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1014927805247     Document Type: Article

References (7)

1. W.N. Anderson and T.D. Morley, Eigenvalues of the Laplacian of a graph, Linear and Multilinear Algebra 18 (1985) 141-145.
2. N. Biggs, How to compute the spectral density of a lattice and its quotients, CDAM Report Series, LSE (1994).
3. R. Grone and G. Zimmermann, Large eigenvalues of the Laplacian, Linear and Multilinear Algebra 28 (1990) 45-47.
4. R.A. Horn and C.H. Johnson, Matrix Analysis (Cambridge University Press, Cambridge, 1985).
5. R. Merris, A note on Laplacian graph eigenvalues, Linear Algebra and its Applications 285 (1998) 33-35.
6. B. Mohar, Some applications of Laplace eigenvalues of graphs, in: Graph Symmetry: Algebraic Methods and Applications, eds. G. Hahn and G. Sabidussi, NATO Advanced Science Institutes Series C 497 (Kluwer Academic, 1997) 225-275.
7. J. van den Heuvel and S. Pejić, Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems, CDAM Report Series, LSE (2000).