Yazar "Leydold, Josef" için Fen Edebiyat Fakültesi / Faculty of Arts and Sciences listeleme
-
Algebraic connectivity and degree sequences of trees
Bıyıkoğlu, Türker; Leydold, Josef (Elsevier Science Inc, 2009-01-15)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 vertex degrees are non-decreasing on every ... -
Dendrimers are the unique chemical trees with maximum spectral radius
Bıyıkoğlu, Türker; Leydold, Josef (Univ Kragujevac, 2012)It is shown that dendrimers have maximum spectral radius and maximum Collatz-Sinogowitz index among all chemical trees of given size. The result is also generalized for the class of chemical trees with prescribed number ... -
Graphs of given order and size and minimum algebraic connectivity
Bıyıkoğlu, Türker; Leydold, Josef (Elsevier Science Inc, 2012-04-01)The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal ... -
Graphs with given degree sequence and maximal spectral radius
Bıyıkoğlu, Türker; Leydold, Josef (Electronic Journal of Combinatorics, 2008-09-15)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 degree sequence is non-increasing with respect ... -
Laplacian Eigenvectors of graphs
Bıyıkoğlu, Türker; Leydold, Josef; Stadler, Peter F. (Springer Verlag, 2007)[No abstract available] -
Laplacian eigenvectors of graphs: Perron-Frobenius and Faber-Krahn type theorems
Bıyıkoğlu, Türker; Leydold, Josef; Stadler, Peter F. (Springer Verlag, 2007)Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are ... -
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
Bıyıkoğlu, Türker; Hellmuth, Marc; Leydold, Josef (Int Linear Algebra Soc, 2009-03)Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence are characterized. It is shown that such extremal trees can be obtained by breadth-first search where the vertex degrees ... -
Preface
Bıyıkoğlu, Türker; Leydold, Josef; Stadler, Peter F. (Springer Verlag, 2007)[No abstract available] -
Semiregular trees with minimal Laplacian spectral radius
Bıyıkoğlu, Türker; Leydold, Josef (Elsevier Inc, 2010-04-15)A semiregular tree is a tree where all non-pendant vertices have the same degree. Among all semiregular trees with fixed order and degree, a graph with minimal (adjacency/Laplacian) spectral radius is a caterpillar. Counter ...