Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
From MaRDI portal
Publication:2282779
DOI10.1016/j.laa.2019.10.023zbMath1429.05123arXiv1806.01006OpenAlexW2805505284MaRDI QIDQ2282779
Publication date: 19 December 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.01006
generalized Fourier transformanalytical structure of eigenvalues of the graph Laplaciananalytical structure of eigenvectors of the graph Laplacian
Trees (05C05) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-similarity, operators and dynamics
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- Spectra of random graphs with given expected degrees