Constructions of graphs and trees with partially prescribed spectrum

MaRDI QIDQ4956529zbMATH OpenFDO

Authors Ivan Gutman, Xueliang Li, Wasin So

Publication date 2 September 2021

Full work available at URL https://arxiv.org/abs/1611.01938

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

Abstract: It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally real algebraic integer is an eigenvalue of a tree. Our result implies that for any (not necessarily connected) graph $G$, there is a tree $T$ such that the characteristic polynomial $P(G,x)$ of $G$ can divide the characteristic polynomial $P(T,x)$ of $T$, i.e., $P(G,x)$ is a divisor of $P(T,x)$.

Recommendations

• Constructing trees with given eigenvalues and angles
• Every totally real algebraic integer is a tree eigenvalue
• Construction of matrices with a given graph and prescribed interlaced spectral data
• The inverse characteristic polynomial problem for trees
• Implicit construction of multiple eigenvalues for trees

Cited in

(2)

• Construction of real skew-symmetric matrices from interlaced spectral data, and graph
• Every totally real algebraic integer is a tree eigenvalue

This page was built for publication: Constructions of graphs and trees with partially prescribed spectrum

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