Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems

DOI10.1023/A:1014927805247MaRDI QIDQ1599359zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

eigenvalueseigenvectorsLaplacian matrixweighted graphfrequency assignment problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Discrete location and assignment (90B80)

Recommendations

• Bounds for the frequency assignment problem
• scientific article; zbMATH DE number 1819633
• Elementary landscape decomposition of the frequency assignment problem
• scientific article; zbMATH DE number 4065018
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM

Cited in

(5)

• Spectral properties of unimodular lattice triangulations
• Spectral properties of inverse sum indeg index of graphs
• Elementary landscape decomposition of the frequency assignment problem
• Laplacian linear discriminant analysis
• Nonlinear discriminant mapping using the Laplacian of a graph

This page was built for publication: Using Laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599359)