Preprint sets conditions for minimum-energy partitions of graphs
A mathematical preprint gives conditional existence results for connected partitions of weighted finite and countably infinite graphs. Its ladder examples show that Dirichlet, Neumann and boundaryless rules can select different minimizing shapes—and that unit weights can make parts of the infinite problem ill-defined.
Scientific publication3 min read