Two inverse eigenvalue problems for matrices whose graphs are trees

Abstract

Inverse eigenvalue problem refers to the problem of reconstructing a matrix of a desired structure from a prescribed eigendata. In this paper, we discuss two additive inverse eigenvalue problems for matrices whose graph is tree. In order to analyze the problems, the vertices of the given tree are labeled in a suitable way so that concrete recurrence relations between the characteristic polynomials of the leading principal submatrices of the matrix can be obtained in a simple form. The method of obtaining the entries of the required matrix is constructive and provides an algorithm for computing the same. We provide some numerical examples to illustrate the results. The computations are done using SCILAB by feeding the eigendata and the adjacency pattern of the tree as inputs.

KEYWORDS:

• Additive inverse eigenvalue problem
• matrix of a tree
• leading principal submatrices

AMS CLASSIFICATION:

• 05C05
• 65F18