Laplacian eigenvalues and fixed size multisection

DOI10.1016/S0012-365X(03)00307-8MaRDI QIDQ1422418zbMATH OpenOpenAlexFDO

Authors C. Delorme

Publication date 14 February 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(03)00307-8

zbMATH Keywords

BisectionEigenvaluesGramLaplacianMax cutMultisection

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Laplacian eigenvalues and multisections
• Spectra and optimal partitions of weighted graphs
• Lower bounds of the Laplacian graph eigenvalues
• Laplacian eigenvalues and the maximum cut problem
• Spectral bounds for graph partitioning with prescribed partition sizes

Cites work

• Approximate graph coloring by semidefinite programming
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1054729 (Why is no real title available?)
• Improved approximation algorithms for MAX k-CUT and MAX BISECTION
• Laplacian eigenvalues and the maximum cut problem
• Lower Bounds for the Partitioning of Graphs
• Nondifferentiable optimization and polynomial problems
• On the Shannon capacity of a graph

Cited in

(2)

• Laplacian eigenvalues and multisections
• Laplacian eigenvectors and eigenvalues and almost equitable partitions

This page was built for publication: Laplacian eigenvalues and fixed size multisection

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