On discreteness of Laplacians on infinite metric trees
Borislav Kirilov
Ecole Normale Supérieure – PSL, Paris, France

Abstract
We characterize locally finite metric trees with finitely many ends of infinite volume for which the Neumann Laplacian has purely discrete spectrum. In particular, for infinite comb graphs this criterion admits a transparent formulation by means of heights and distances between neighboring teeth.
Cite this article
Borislav Kirilov, On discreteness of Laplacians on infinite metric trees. J. Spectr. Theory (2026), published online first
DOI 10.4171/JST/625