An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
From MaRDI portal
Publication:2383023
Recommendations
- scientific article; zbMATH DE number 5952367
- scientific article; zbMATH DE number 5199182
- The spectra of some trees and bounds for the largest eigenvalue of any tree
- On the largest eigenvalues of trees
- On the largest \(k\)th eigenvalues of trees
- Improved bounds for the largest eigenvalue of trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Bounds on the \(k\)th eigenvalues of trees and forests
- On the two largest eigenvalues of trees
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Eigenvalues and eigenvectors of tridiagonal matrices
- Iterative Methods for Solving Matrix Equations
- Matrix theory. Basic results and techniques
- The spectra of some trees and bounds for the largest eigenvalue of any tree
- The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
Cited in
(28)- Improved bounds for the Laplacian energy of Bethe trees
- The normalized Laplacian polynomial of rooted product of graphs
- Perron value and moment of rooted trees
- On eigenvalues and the energy of dendrimer trees
- On spectral radius of graphs with pendant paths
- On the spectrum of finite, rooted homogeneous trees
- Applications of recurrence relations for the characteristic polynomials of Bethe trees
- On the characteristic polynomial of a special class of graphs and spectra of balanced trees
- Path counting on simple graphs: from escape to localization
- Trees with 4 or 5 distinct normalized Laplacian eigenvalues
- On the spectra of reduced distance matrix of the generalized Bethe trees
- Exploring symmetries to decompose matrices and graphs preserving the spectrum
- On the location of zeros of the Laplacian matching polynomials of graphs
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
- Dendrimer eigen-characteristics
- The eigenvalues of a tridiagonal matrix in biogeography
- Periodicity of Grover walks on generalized Bethe trees
- Spectra of large random trees
- Line graph of combinations of generalized Bethe trees: Eigenvalues and energy
- The Laplacian energy of threshold graphs and majorization
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
- On the \(A_{\alpha}\)-spectra of trees
- On the main spectrum of generalized Bethe trees
- The matching polynomial of the path-tree of a complete graph
- The general Albertson irregularity index of graphs
- The signless Laplacian spectrum of rooted product of graphs
- Eigen-persistence in graphs
- Peculiar spectral statistics of ensembles of trees and star-like graphs
This page was built for publication: An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383023)