2 citations · 3 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2008
Algebraic Connectivity and Degree Sequences of Trees
Tuerker Biyikoglu, Josef Leydold
We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the v…
math.CO2008★ 2 cited
Largest Laplacian Eigenvalue and Degree Sequences of Trees
Tuerker Biyikoglu, Marc Hellmuth, Josef Leydold
We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence…
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…