A Faber-Krahn-type inequality for regular trees

DOI10.1007/PL00001623zbMath0892.05027OpenAlexW1982635777MaRDI QIDQ1355455

Josef Leydold

Publication date: 27 July 1998

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001623

zbMATH Keywords

treeDirichlet eigenvaluesLaplacian matrixFaber-Krahn theorem

Mathematics Subject Classification ID

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

Related Items (7)

Faber-Krahn type inequalities for trees ⋮ Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ A decreasing rearrangement for functions on homogeneous trees ⋮ The spectral radius of bicyclic graphs with prescribed degree sequences ⋮ A further result on majorization theorem ⋮ Faber–Krahn type inequality for unicyclic graphs

This page was built for publication: A Faber-Krahn-type inequality for regular trees