Computing the characteristic polynomial of a tree

DOI10.1007/BF02260499zbMath0564.05004OpenAlexW425642051MaRDI QIDQ1057861

H. Schreck, Gottfried Tinhofer

Publication date: 1985

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02260499

zbMATH Keywords

treealgorithmcharacteristic polynomialfactorizationsminimal polynomialspectra of graphs

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Related Items

Efficient Computation of the Characteristic Polynomial of a Threshold Graph ⋮ Efficient computation of the characteristic polynomial of a threshold graph ⋮ Efficient computation of the characteristic polynomial of a tree and related tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• Linear time tree codes
• On the eigenvalues of trees
• Cospectral Graphs and Digraphs