A Faber-Krahn-type inequality for regular trees
type: Item
instance of: scholarly article
title: A Faber-Krahn-type inequality for regular trees
zbMATH Open document ID: 0892.05027
DOI: 10.1007/PL00001623
published in: Geometric and Functional Analysis. GAFA
publication date: 1998-07-27T00:00:00Z
review text: A tree is \(d\)-semiregular if each of its vertices has degree \(d\) or 1. Such a tree can be viewed as finite connected (metric) subspace of the infinite \(d\)-regular tree \(T_d\) so that the vertices of degree 1 may correspond either to vertices of \(T_d\) or to interior points on the edges of \(T_d\). Under this interpretation, each edge \(e\) of \(T\) has length \(c_e\leq 1\), and \(c_e\) is smaller than 1 if and only if an endvertex of \(e\) corresponds to an interior point of an edge of \(T_d\). The Dirichlet eigenvalues of \(T\) are the eigenvalues of the Laplacian matrix \(\Delta_0= D_0-A_0\) where \(A_0\) is the adjacency matrix of the subgraph of \(T\) induced on all vertices of degree more than 1, and \(D_0\) is the diagonal matrix whose entry corresponding to the vertex \(v\) equals the sum of the lengths of edges incident with \(v\) in \(T\). The celebrated Faber-Krahn theorem states that among all bounded domains \(D \subseteq \mathbb{R}^n\) of given volume, a ball has smallest first Dirichlet eigenvalue (corresponding to the Laplacian in \(\mathbb{R}^n)\). In this paper, a similar result is proved for \(d\)-semiregular trees. It is shown that among all such trees of given ``volume'', the first Dirichlet eigenvalue is minimum on graphs which are similar to ``balls''. Amazingly, these graphs can be more general than conjectured by \textit{J. Friedman} in [Some geometric aspects of graphs and their eigenfunctions, Duke Math. J. 69, No. 3, 487-525 (1993; Zbl 0785.05066)].
reviewed by: Bojan Mohar
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1013776
zbMATH Keywords: tree
zbMATH Keywords: Dirichlet eigenvalues
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: Faber-Krahn theorem
author: Josef Leydold
MaRDI profile type: Publication
full work available at URL: pl00001623
OpenAlex ID: W1982635777
Recommended article: Faber-Krahn type inequalities for trees
Recommended article: The geometry of regular trees with the Faber-Krahn property
Recommended article: Eigenvalue estimates for the Laplacian on a metric tree
Recommended article: Semiregular trees with minimal Laplacian spectral radius
Recommended article: Q5503322
Recommended article: Q4256008
Recommended article: The minimal Laplacian spectral radius of trees with diameter 4
Recommended article: Q4980760
Recommended article: On the spectrum, the growth, and the diameter of a graph
Recommended article: The Faber-Krahn type isoperimetric inequalities for a graph
description: scientific article; zbMATH DE number 1013776