Semiregular Trees with Minimal Laplacian Spectral Radius

Biyikoglu, Türker and Leydold, Josef (2009) Semiregular Trees with Minimal Laplacian Spectral Radius. Research Report Series / Department of Statistics and Mathematics, 93. Department of Statistics and Mathematics, WU Vienna University of Economics and Business, Vienna.

[img]
Preview
PDF
document.pdf

Download (169kB)

Abstract

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 examples show that the result cannot be generalized to the class of trees with a given (non-constant) degree sequence.

Item Type: Paper
Additional Information: Article published in Linear Algebra and its Applications.
Keywords: graph Laplacian / adjacency matrix / eigenvectors / spectral radius / Perron vector / tree
Classification Codes: MSC 05C35, 05C75, 05C05, 05C50
Divisions: Departments > Finance, Accounting and Statistics > Statistics and Mathematics
Depositing User: Repository Administrator
Date Deposited: 06 Oct 2009 14:37
Last Modified: 16 Jun 2019 03:39
FIDES Link: https://bach.wu.ac.at/d/research/results/49905/
URI: https://bach-s59.wu.ac.at/id/eprint/986

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics