Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems
From MaRDI portal
Publication:1599359
DOI10.1023/A:1014927805247zbMath1015.90051OpenAlexW226441283MaRDI QIDQ1599359
Jan van den Heuvel, Snežana Pejić
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014927805247
Programming involving graphs or networks (90C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Discrete location and assignment (90B80) Coloring of graphs and hypergraphs (05C15)
Related Items
Spectral properties of unimodular lattice triangulations, Spectral properties of inverse sum indeg index of graphs, Laplacian linear discriminant analysis, Nonlinear discriminant mapping using the Laplacian of a graph
