TY - JOUR
TI - Faber-Krahn Type Inequality for Trees
AB - The Faber-Krahn theorem states that the ball has lowest first Dirichlet eigenvalue amongst all bounded domains of the same volume in View the MathML source (with the standard Euclidean metric). It has been shown that a similar result holds for (semi-) regular trees. In this article we show that such a theorem also holds for other classes of (not necessarily regular) trees, for example for trees with the same degree sequence. Then the resulting trees possess a spiral like ordering of their vertices, i.e., are ball approximations.
DO - http://dx.doi.org/10.1016/j.jctb.2006.04.005
SP - 159
EP - 174
UR - http://dx.doi.org/10.1016/j.jctb.2006.04.005
PY - 2007-01-01
JO - Journal of Combinatorial Theory, Series B
AU - Biyikoglu, TÃ¼rker
AU - Leydold, Josef
ER -