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 conditions for the solvability of the problem is derived. An algorithm to construct the solution is provided.
Babaei Zarch, M., Shahzadeh Fazeli, S. A., & Karbassi, S. M. (2018). Inverse eigenvalue problem for matrices whose graph is a banana tree. Journal of Algorithms and Computation, 50(issue 2), 89-101. doi: 10.22059/jac.2018.69994
MLA
Maryam Babaei Zarch; Seyed Abolfazl Shahzadeh Fazeli; Seyed Mehdi Karbassi. "Inverse eigenvalue problem for matrices whose graph is a banana tree". Journal of Algorithms and Computation, 50, issue 2, 2018, 89-101. doi: 10.22059/jac.2018.69994
HARVARD
Babaei Zarch, M., Shahzadeh Fazeli, S. A., Karbassi, S. M. (2018). 'Inverse eigenvalue problem for matrices whose graph is a banana tree', Journal of Algorithms and Computation, 50(issue 2), pp. 89-101. doi: 10.22059/jac.2018.69994
VANCOUVER
Babaei Zarch, M., Shahzadeh Fazeli, S. A., Karbassi, S. M. Inverse eigenvalue problem for matrices whose graph is a banana tree. Journal of Algorithms and Computation, 2018; 50(issue 2): 89-101. doi: 10.22059/jac.2018.69994
)