Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences

From MaRDI portal
Publication:3394467

DOI10.13001/1081-3810.1305zbMATH Open1169.05335arXiv0804.2776OpenAlexW1535404779MaRDI QIDQ3394467FDOQ3394467


Authors: Türker Bıyıkoğlu, Marc Hellmuth, Josef Leydold Edit this on Wikidata


Publication date: 7 September 2009

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Abstract: 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 is non-increasing with respect to an ordering of the vertices that is obtained by breadth-first search. This structure is uniquely determined up to isomorphism. We also show that the maximum eigenvalue in such classes of trees is strictly monotone with respect to majorization.


Full work available at URL: https://arxiv.org/abs/0804.2776

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (7)





This page was built for publication: Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394467)