Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences
DOI10.13001/1081-3810.1305zbMATH Open1169.05335arXiv0804.2776OpenAlexW1535404779MaRDI QIDQ3394467FDOQ3394467
Authors: 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Cited In (7)
- Semiregular trees with minimal Laplacian spectral radius
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Spectral moments of trees with given degree sequence
- Greedy trees, subtrees and antichains
- Diameters, distortion, and eigenvalues
- Parabolic theory of the discrete \(p\)-Laplace operator
- 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)