An Explicit Formula for the Eigenvectors of Acyclic Matrices and Weighted Trees
Combinatorics
2016-09-09 v1
Abstract
Let be an acyclic symmetric matrix of order . There is a weighted forest whose adjacency matrix is . In this paper, using some results on matching polynomials, we provide an explicit formula for eigenvectors of .
Keywords
Cite
@article{arxiv.1609.02399,
title = {An Explicit Formula for the Eigenvectors of Acyclic Matrices and Weighted Trees},
author = {Asghar Bahmani and Dariush Kiani},
journal= {arXiv preprint arXiv:1609.02399},
year = {2016}
}
Comments
10 pages, 2 figures