The spectra of a graph obtained from copies of a generalized Bethe tree

DOI10.1016/j.laa.2006.08.006zbMath1111.05063OpenAlexW1965335763MaRDI QIDQ861010

Oscar Rojo

Publication date: 9 January 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.08.006

zbMATH Keywords

adjacency matrixLaplacian matrixalgebraic connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Dendrimer eigen-characteristics, Unnamed Item, On the main spectrum of generalized Bethe trees, New upper bounds on the spectral radius of unicyclic graphs, Computing tight upper bounds on the algebraic connectivity of certain graphs, Ordering trees and graphs with few cycles by algebraic connectivity, Computing the Laplacian spectra of some graphs, Spectra of large random trees, Spectra of copies of a generalized Bethe tree attached to any graph, On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree, On the characteristic and Laplacian polynomials of trees, Spectra of M-rooted product of graphs

Cites Work

• 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
• Theory of monomer-dimer systems
• Iterative Methods for Solving Matrix Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item