The inverse characteristic polynomial problem for trees

DOI10.1007/978-3-030-51945-2_17MaRDI QIDQ1980921zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 9 September 2021

Full work available at URL https://doi.org/10.1007/978-3-030-51945-2_17

zbMATH Keywords

characteristic polynomialinverse eigenvalue problemmatrix theorypartial fractions

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29)

Review text

The authors are interested in understanding which real polynomials occur as characteristic polynomials of real matrices for a given tree. For a tree \(T\), let \(\mathcal{R}(T)\) denote the set of real matrices whose graph is \(T\). A constructive method (see Theorem 3.5) is provided: for each tree it provides many characteristic polynomials from \(\mathcal{R}(T)\), and for many trees (paths and trees with fewer than ten vertices) gives all of them. For the entire collection see [Zbl 1471.47002].

Recommendations

• scientific article; zbMATH DE number 1472121
• Computing the characteristic polynomial of a tree
• On the characteristic and Laplacian polynomials of trees
• Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive results
• scientific article; zbMATH DE number 3891410

Cites work

• Construction of acyclic matrices from spectral data
• Eigenvalues, multiplicities and graphs
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Inverse eigenvalue problems
• Synthetic Partial Fraction Decompositions

Cited in

(3)

• Inverses of trees
• Constructions of graphs and trees with partially prescribed spectrum
• The inverse problem for certain tree parameters

This page was built for publication: The inverse characteristic polynomial problem for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980921)