The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
From MaRDI portal
(Redirected from Publication:2484482)
Recommendations
Cited in
(52)- On the characteristic and Laplacian polynomials of trees
- The spectrum of the Laplacian matrix of a balanced binary tree
- Computing the Laplacian spectra of some graphs
- A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree
- On the main spectrum of generalized Bethe trees
- The full spectrum of random walks on complete finite \(d\)-ary trees
- Spectral properties of balanced trees and dendrimers
- Dendrimer eigen-characteristics
- On the spectrum of finite, rooted homogeneous trees
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
- Upper bound on Randić energy of some graphs
- On the sth Laplacian eigenvalue of trees of order st+1
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- The ancestral matrix of a rooted tree
- New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
- Improved bounds for the largest eigenvalue of trees
- scientific article; zbMATH DE number 4014760 (Why is no real title available?)
- Path counting on simple graphs: from escape to localization
- Peculiar spectral statistics of ensembles of trees and star-like graphs
- scientific article; zbMATH DE number 3891410 (Why is no real title available?)
- Zeros of semilinear systems with applications to nonlinear partial difference equations on graphs†
- On the kernel of tree incidence matrices
- On the smallest eigenvalues of the line graphs of some trees
- On the \(A_{\alpha}\)-spectra of trees
- Line graph of combinations of generalized Bethe trees: Eigenvalues and energy
- Navier-Stokes equations on weighted graphs
- Locating the eigenvalues of trees
- The Normalized Laplacian Spectrum of Folded Hypercube with Applications
- On the distance spectrum of generalized balanced trees
- Eigen-persistence in graphs
- The level matrix of a tree and its spectrum
- The spectrum of the Laplacian matrix of a balanced 2pary tree
- Population persistence in Cayley trees
- Symmetries of hypergraphs and some invariant subspaces of matrices associated with hypergraphs
- On some building blocks of hypergraphs
- Equitable partitions and spectra of symmetric trees: revisiting Heilbronner's composition principle
- Spectra of large random trees
- Periodicity of Grover walks on generalized Bethe trees
- A complete characterization of spectra of the Randić matrix of level-wise regular trees
- The spectra of some trees and bounds for the largest eigenvalue of any tree
- On the spectra of certain rooted trees
- Tight bounds on the algebraic connectivity of Bethe trees
- On the spectra of some weighted rooted trees and applications
- The spectra of a graph obtained from copies of a generalized Bethe tree
- On the spectra of some graphs like weighted rooted trees
- Spectra of weighted generalized Bethe trees joined at the root
- On the characteristic polynomial of a special class of graphs and spectra of balanced trees
- Spectra of generalized Bethe trees attached to a path
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- Improved bounds for the Laplacian energy of Bethe trees
- Topologies and Laplacian spectra of a deterministic uniform recursive tree
- Applications of recurrence relations for the characteristic polynomials of Bethe trees
This page was built for publication: The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484482)
