The spectrum of the Laplacian matrix of a balanced binary tree

DOI10.1016/S0024-3795(02)00256-2zbMath0995.05093MaRDI QIDQ1611867

Oscar Rojo

Publication date: 28 August 2002

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

zbMATH Keywords

Laplacian eigenvaluesLaplacian matrixbalanced binary tree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Maximizing algebraic connectivity for certain families of graphs, Exploring Symmetries to Decompose Matrices and Graphs Preserving the Spectrum, The full spectrum of random walks on complete finite \(d\)-ary trees, On the characteristic and Laplacian polynomials of trees, A note on the integer eigenvalues of the Laplacian matrix of a balanced binary tree

Cites Work

• Eigenvalues and eigenvectors of symmetric centrosymmetric matrices
• Laplacian matrices of graphs: A survey
• Tight bounds on the algebraic connectivity of a balanced binary tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item