| dc.contributor.author | Babaei Zarch, Maryam | en_US |
| dc.contributor.author | Shahzadeh Fazeli, Seyed Abolfazl | en_US |
| dc.contributor.author | Karbassi, Seyed Mehdi | en_US |
| dc.date.accessioned | 1399-07-09T06:07:37Z | fa_IR |
| dc.date.accessioned | 2020-09-30T06:07:37Z | |
| dc.date.available | 1399-07-09T06:07:37Z | fa_IR |
| dc.date.available | 2020-09-30T06:07:37Z | |
| dc.date.issued | 2018-12-01 | en_US |
| dc.date.issued | 1397-09-10 | fa_IR |
| dc.date.submitted | 2018-04-11 | en_US |
| dc.date.submitted | 1397-01-22 | fa_IR |
| dc.identifier.citation | Babaei Zarch, Maryam, Shahzadeh Fazeli, Seyed Abolfazl, Karbassi, Seyed Mehdi. (2018). Inverse eigenvalue problem for matrices whose graph is a banana tree. Journal of Algorithms and Computation, 50(2), 89-101. | en_US |
| dc.identifier.issn | 2476-2776 | |
| dc.identifier.issn | 2476-2784 | |
| dc.identifier.uri | https://jac.ut.ac.ir/article_69994.html | |
| dc.identifier.uri | https://iranjournals.nlai.ir/handle/123456789/296010 | |
| dc.description.abstract | 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<br />for the solvability of the problem is derived. An algorithm to construct the solution is provided. | en_US |
| dc.format.extent | 317 | |
| dc.format.mimetype | application/pdf | |
| dc.language | English | |
| dc.language.iso | en_US | |
| dc.publisher | University of Tehran | en_US |
| dc.relation.ispartof | Journal of Algorithms and Computation | en_US |
| dc.subject | Inverse eigenvalue problem | en_US |
| dc.subject | banana tree | en_US |
| dc.subject | leading principal minors | en_US |
| dc.subject | eigenvalue | en_US |
| dc.subject | graph of a matrix | en_US |
| dc.title | Inverse eigenvalue problem for matrices whose graph is a banana tree | en_US |
| dc.type | Text | en_US |
| dc.type | Research Paper | en_US |
| dc.contributor.department | Department of Computer Science, Yazd University, Yazd, Iran. | en_US |
| dc.contributor.department | Department of Computer Science, Yazd University, Yazd, Iran. | en_US |
| dc.contributor.department | Department of Mathematical Science, Yazd University, Yazd, Iran. | en_US |
| dc.citation.volume | 50 | |
| dc.citation.issue | 2 | |
| dc.citation.spage | 89 | |
| dc.citation.epage | 101 | |
| nlai.contributor.orcid | 0000-0002-3724-8689 | |
