2 citations · 5 across the 6 of their papers we have counts for
6 papers
Semiregular Trees with Minimal Index
Tuerker Biyikoglu, Josef Leydold
A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semi…
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…
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…
Graphs with Given Degree Sequence and Maximal Spectral Radius
Tuerker Biyikoglu, Josef Leydold
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degr…
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…
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.