2 papers
cs.DS2025
Spectral partitioning of graphs into compact, connected regions
Ewan Davies, Ryan Job, Maxine Kampbell +2
We define and study a spectral recombination algorithm, SpecReCom, for partitioning a graph into a given number of connected parts. It is straightforward to introduce additional co…
math.SP2025
Two disks maximize the third Robin eigenvalue: positive parameters
Hanna N. Kim, Richard S. Laugesen
The third eigenvalue of the Robin Laplacian on a simply-connected planar domain of given area is bounded above by the corresponding eigenvalue of a disjoint union of two equal disk…