
تعداد نشریات | 162 |
تعداد شمارهها | 6,622 |
تعداد مقالات | 71,534 |
تعداد مشاهده مقاله | 126,862,560 |
تعداد دریافت فایل اصل مقاله | 99,905,207 |
Inverse eigenvalue problem for matrices whose graph is a banana tree | ||
Journal of Algorithms and Computation | ||
مقاله 7، دوره 50، issue 2، اسفند 2018، صفحه 89-101 اصل مقاله (317.16 K) | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22059/jac.2018.69994 | ||
نویسندگان | ||
Maryam Babaei Zarch1؛ Seyed Abolfazl Shahzadeh Fazeli* 1؛ Seyed Mehdi Karbassi2 | ||
1Department of Computer Science, Yazd University, Yazd, Iran. | ||
2Department of Mathematical Science, Yazd University, Yazd, Iran. | ||
چکیده | ||
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. | ||
کلیدواژهها | ||
Inverse eigenvalue problem؛ banana tree؛ leading principal minors؛ eigenvalue؛ graph of a matrix | ||
آمار تعداد مشاهده مقاله: 331 تعداد دریافت فایل اصل مقاله: 324 |