<![CDATA[The eigenvalues and the eigenvectors of a matrix are fundamental concepts in max-plus algebra, especially for square matrices. A communication graph is classified as strongly connected or not, corresponding to irreducible and reducible matrices, respectively. This study aims to develop methods for determining the eigenvectors of reducible matrices over min-plus algebra. Before determining the eigenvectors, we need to determine the eigenvalues. The methodology used is based on the Frobenius Normal Form and graph condensation to decompose the reducible matrix into spectral classes. The eigenvalues can be found using the graphical method. Eigenvectors can be determined for each corresponding eigenvalue. Once the eigenvectors are known, we can find the set of eigenvectors as a map of a matrix. The main results include a characterization of eigenvector bases for each spectral class, criteria for the existence of finite eigenvectors, and an analysis of computational complexity. An isomorphic correspondence exists between min-plus algebra and max-plus algebra. Hence, the eigenvectors of reducible matrices over min-plus algebra are able to be evaluated according to a concept from eigenvectors of reducible matrices over max-plus algebra. This study is limited to min-plus algebra and does not extend to interval min-plus algebra.]]>
Copyrights © 2026
