Laplacian eigenvalues and fixed size multisection

DOI10.1016/S0012-365X(03)00307-8zbMath1031.05081OpenAlexW2059689705MaRDI QIDQ1422418

Charles 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

LaplacianEigenvaluesBisectionMultisectionMax cutGram

Mathematics Subject Classification ID

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

Cites Work

• Laplacian eigenvalues and the maximum cut problem
• Nondifferentiable optimization and polynomial problems
• Approximate graph coloring by semidefinite programming
• On the Shannon capacity of a graph
• Lower Bounds for the Partitioning of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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