Faber-Krahn type inequalities for trees

DOI10.1016/j.jctb.2006.04.005zbMath1109.05066arXivmath/0312287OpenAlexW2044554413MaRDI QIDQ864896

Türker Bıyıkoğlu, Josef Leydold

Publication date: 13 February 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0312287

zbMATH Keywords

Laplaciandegree sequenceDirichlet eigenvalue problem

Mathematics Subject Classification ID

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

Related Items (4)

The first Dirichlet eigenvalue of bicyclic graphs ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ Weighted join operators on directed trees ⋮ Faber–Krahn type inequality for unicyclic graphs

Cites Work

• Recent results in the theory of graph spectra
• Some geometric aspects of graphs and their eigenfunctions
• The Faber-Krahn type isoperimetric inequalities for a graph
• Parallel concepts in graph theory
• The geometry of regular trees with the Faber-Krahn property
• A Faber-Krahn-type inequality for regular trees
• Faber-Krahn inequalities and Sobolev-Orlicz inclusions
• Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees
• Algebraic Graph Theory
• Discrete nodal domain theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faber-Krahn type inequalities for trees