Standard

On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph. / Buslov, V.A.

In: Journal of Mathematical Sciences, Vol. 232, No. 1, 2018, p. 6-20.

Research output: Contribution to journal › Article › peer-review

Harvard

Buslov, VA 2018, 'On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph', Journal of Mathematical Sciences, vol. 232, no. 1, pp. 6-20. https://doi.org/10.1007/s10958-018-3854-5

APA

Buslov, V. A. (2018). On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph. Journal of Mathematical Sciences, 232(1), 6-20. https://doi.org/10.1007/s10958-018-3854-5

Vancouver

Buslov VA. On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph. Journal of Mathematical Sciences. 2018;232(1):6-20. https://doi.org/10.1007/s10958-018-3854-5

Author

Buslov, V.A. / On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph. In: Journal of Mathematical Sciences. 2018 ; Vol. 232, No. 1. pp. 6-20.

BibTeX

@article{bf4c4d1c9178430394111d536ef3f92b,
title = "On the Characteristic Polynomial and Eigenvectors in Terms of the Tree-Like Structure of a Digraph",
abstract = "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.",
author = "V.A. Buslov",
year = "2018",
doi = "10.1007/s10958-018-3854-5",
language = "English",
volume = "232",
pages = "6--20",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "1",

}

RIS

TY - JOUR

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

AU - Buslov, V.A.

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

U2 - 10.1007/s10958-018-3854-5

DO - 10.1007/s10958-018-3854-5

M3 - Article

VL - 232

SP - 6

EP - 20

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 1

ER -

ID: 37663941