2 citations · 3 across the 3 of their papers we have counts for
2 papers
math.CO2003★ 1 cited
Faber-Krahn Type Inequalities for Trees
Tuerker Biyikoglu, Josef Leydold
The Faber-Krahn theorem states that among all bounded domains with the same volume in (with the standard Euclidean metric), a ball that has lowest first Dirichlet e…
math.SP2000
Discrete Nodal Domain Theorems
E. Brian Davies, Josef Leydold, Peter F. Stadler
We give a detailed proof for two discrete analogues of Courant's Nodal Domain Theorem.