TY - JOUR ID - 69994 TI - Inverse eigenvalue problem for matrices whose graph is a banana tree JO - Journal of Algorithms and Computation JA - JAC LA - en SN - 2476-2776 AU - Babaei Zarch, Maryam AU - Shahzadeh Fazeli, Seyed Abolfazl AU - Karbassi, Seyed Mehdi AD - Department of Computer Science, Yazd University, Yazd, Iran. AD - Department of Mathematical Science, Yazd University, Yazd, Iran. Y1 - 2018 PY - 2018 VL - 50 IS - issue 2 SP - 89 EP - 101 KW - Inverse eigenvalue problem KW - banana tree KW - leading principal minors KW - eigenvalue KW - graph of a matrix DO - 10.22059/jac.2018.69994 N2 - 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. UR - https://jac.ut.ac.ir/article_69994.html L1 - https://jac.ut.ac.ir/article_69994_2c6384790926c12c2f8526d4ea76dc44.pdf ER -