شماره ركورد كنفرانس :
3806
عنوان مقاله :
Inverse spectral problem for matrices whose graph is a m-centipede
پديدآورندگان :
Babaei Zarch M maryam.babaei@stu.yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran , Shahzadeh Fazeli S. A fazeli@yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran
كليدواژه :
Inverse spectral problem , graph of a matrix , leading principal minors , eigenvalue , eigenpair.
عنوان كنفرانس :
دهمين كنفرانس ملي نظريه گراف و تركيبات جبري
چكيده فارسي :
In this paper, we investigate inverse eigenvalue problem(IEP)for constructing a special kind of acyclic matrices. The problem involves the reconstruction of matrices whose graph is a m-centipede. This is performed by using the eigenvalues of every leading principal submatrices and especially the (2m−1)th and (2m)th eigenpairs of their leading principal submatrices. For solving the problem, the recurrence relations among leading principal minors is used.
