On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph

Аннотация

Regarding a square matrix as the adjacency matrix of a weighted digraph, we construct an extended digraph whose Laplacian contains the original matrix as a submatrix. This construction allows us to use known results on Laplacians to study arbitrary square matrices. The calculation of an eigenvector in a parametric form demonstrates a connection between its components and the tree-like structure of the digraph.