An Explicit Formula for the Eigenvectors of Acyclic Matrices and Weighted Trees
classification
🧮 math.CO
keywords
acycliceigenvectorsexplicitformulamatrixweightedadjacencyforest
read the original abstract
Let $A$ be an acyclic symmetric matrix of order $n$. There is a weighted forest $F$ whose adjacency matrix is $A$. In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of $A$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.