A service provided by the WU Library and the WU IT-Services

Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences

Biyikoglu, Türker and Hellmuth, Marc and Leydold, Josef (2009) Largest Eigenvalues of the Discrete p-Laplacian of Trees with Degree Sequences. Research Report Series / Department of Statistics and Mathematics, 85. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
Download (157Kb) | Preview

Abstract

We characterize trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence. We show that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p. (author´s abstract)

Item Type: Paper
Additional Information: published in: The Electronic Journal of Linear Algebra 18, pp. 202-210, 2009
Keywords: discrete p-Laplacian / largest eigenvalue / eigenvector / tree / degree sequence / majorization
Classification Codes: MSC 05C35, 05C75, 05C05, 05C50
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 23 Mar 2009 12:32
Last Modified: 16 Jul 2015 18:29
URI: http://epub.wu.ac.at/id/eprint/390

Actions

View Item