Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4601836 | Linear Algebra and its Applications | 2010 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory