Inverse eigenvalue problem for matrices whose graph is a banana tree

نویسندگان
Babaei Zarch, Maryam ID 1
Shahzadeh Fazeli, Seyed Abolfazl ID 2
Karbassi, Seyed Mehdi ID 3

1 Department of Computer Science, Yazd University, Yazd, Iran.

2 Department of Computer Science, Yazd University, Yazd, Iran

3 Department of Mathematical Science, Yazd University, Yazd, Iran.

doi
10.22059/jac.2018.69994
چکیده

In this  paper, we consider an  inverse eigenvalue problem (IEP) for constructing  a special  kind of acyclic matrices. The problem involves the reconstruction of matrices whose graph is a  banana tree. This is performed by using the  minimal and maximal eigenvalues of all  leading principal submatrices of the required matrix.  The necessary and sufficient conditionsfor the solvability of the problem is derived. An algorithm to construct the solution is provided.

کلیدواژه‌ها
Inverse eigenvalue problem, banana tree, leading principal minors, eigenvalue, graph of a matrix