Semiregular Trees with Minimal Laplacian Spectral Radius

Türker Biyikoglu, Josef Leydold

Publication: Working/Discussion PaperWU Working Paper

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.
Original languageEnglish
Publication statusPublished - 1 Oct 2009

Publication series

NameResearch Report Series / Department of Statistics and Mathematics
No.93

WU Working Paper Series

  • Research Report Series / Department of Statistics and Mathematics

Cite this