Title of article
Inverse eigenvalue problem for matrices whose graph is a banana tree
Author/Authors
Babaei Zarch, M Department of Computer Science - Yazd University, Yazd , Shahzadeh Fazeli, S. A Department of Computer Science - Yazd University, Yazd , Karbassi, S. M Department of Computer Science - Yazd University, Yazd
Pages
13
From page
89
To page
101
Abstract
In this paper, we consider an inverse eigenvalue problem
(IEP) for constructing a special kind of acyclic matri-
ces. The problem involves the reconstruction of matri-
ces whose graph is a banana tree. This is performed by
using the minimal and maximal eigenvalues of all lead-
ing principal submatrices of the required matrix. The
necessary and sucient conditions for the solvability of
the problem is derived. An algorithm to construct the
solution is provided.
Keywords
Inverse eigenvalue problem , banana tree , leading principal minors , eigenvalue; graph of a matrix
Journal title
Astroparticle Physics
Serial Year
2018
Record number
2469429
Link To Document