Abstract
This paper studies two inverse eigenvalue problems for two kinds of acyclic matrices whose graphs are caterpillars. The spectral data of the first problem considers the minimal and maximal eigenvalues of all leading principal submatrices of the matrix. The second consists of an extremal eigenvalue of each leading principal submatrix and one eigenpair of the matrix. In the main results, we give sufficient conditions for the existence of such matrices, and their proofs provide algorithmic procedures for their construction. Finally, we present some numerical examples that illustrate the applicability of the solutions obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
