Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences

DOI10.13001/1081-3810.1305zbMath1169.05335arXiv0804.2776OpenAlexW1535404779MaRDI QIDQ3394467

Türker Bıyıkoğlu, Marc Hellmuth, Josef Leydold

Publication date: 7 September 2009

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.2776

zbMATH Keywords

treeeigenvectorlargest eigenvaluemajorizationdegree sequencediscrete p-Laplacian

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (5)

Parabolic theory of the discrete \(p\)-Laplace operator ⋮ Greedy trees, subtrees and antichains ⋮ Spectral moments of trees with given degree sequence ⋮ Diameters, distortion, and eigenvalues ⋮ Semiregular trees with minimal Laplacian spectral radius

This page was built for publication: Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences