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.
|Publication status||Published - 1 Oct 2009|
|Name||Research Report Series / Department of Statistics and Mathematics|
- Research Report Series / Department of Statistics and Mathematics