On the characteristic and Laplacian polynomials of trees

DOI10.1016/j.laa.2009.09.011zbMath1221.05207OpenAlexW1986891895MaRDI QIDQ1044560

Abbas Heydari, Bijan Taeri

Publication date: 18 December 2009

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

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

zbMATH Keywords

treecharacteristic polynomialadjacency matrixLaplacian matrix

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

The signless Laplacian spectrum of rooted product of graphs ⋮ Factoring matrices with a tree-structured sparsity pattern

Cites Work

• On the spectra of certain rooted 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 characteristic polynomial of a special class of graphs and spectra of balanced trees
• Families of integral trees with diameters 4, 6, and 8.
• The spectrum of the Laplacian matrix of a balanced binary tree
• The spectra of the adjacency matrix and Laplacian matrix for some balanced trees
• A new graph product and its spectrum
• Unnamed Item
• Unnamed Item

This page was built for publication: On the characteristic and Laplacian polynomials of trees