Semiregular Trees with Minimal Index

Türker Biyikoglu, Josef Leydold

Publication: Working/Discussion PaperWU Working Paper

19 Downloads (Pure)

Abstract

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with index is caterpillar. In this technical report we provide a different proof for this theorem. Furthermore, we give counter examples that show that this result cannot be generalized to the class of trees with a given (non-constant) degree sequence.
Original languageEnglish
DOIs
Publication statusPublished - 1 Jun 2009

Publication series

SeriesResearch Report Series / Department of Statistics and Mathematics
Number86

WU Working Paper Series

  • Research Report Series / Department of Statistics and Mathematics

Cite this