Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
From MaRDI portal
Publication:3394467
Abstract: We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the vertices that is obtained by breadth-first search. This structure is uniquely determined up to isomorphism. We also show that the maximum eigenvalue in such classes of trees is strictly monotone with respect to majorization.
Recommendations
Cited in
(7)- Parabolic theory of the discrete \(p\)-Laplace operator
- Diameters, distortion, and eigenvalues
- Spectral moments of trees with given degree sequence
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Greedy trees, subtrees and antichains
- Semiregular trees with minimal Laplacian spectral radius
- The first mixed eigenvalues of \(p\)-Laplacian on trees
This page was built for publication: Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394467)