On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph
- Autores: Buslov V.1
-
Afiliações:
- St.Petersburg State University
- Edição: Volume 232, Nº 1 (2018)
- Páginas: 6-20
- Seção: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/241249
- DOI: https://doi.org/10.1007/s10958-018-3854-5
- ID: 241249
Citar
Resumo
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.
Sobre autores
V. Buslov
St.Petersburg State University
Autor responsável pela correspondência
Email: abvabv@bk.ru
Rússia, St. Petersburg