Matrices Totally Positive Relative to a Tree, II
R. S. Costas-Santos, C. R. Johnson

TL;DR
This paper proves that for a general tree, T-TP matrices with positive determinant and certain submatrix properties have smallest eigenvalues with eigenvectors signed according to the tree structure.
Contribution
It establishes a new spectral property of T-TP matrices related to eigenvector signs in the context of general trees.
Findings
Smallest eigenvalue eigenvector signs follow the tree structure.
Submatrices associated with pendant vertices are P-matrices.
Positive determinant ensures eigenvector sign pattern.
Abstract
In this paper we prove that for a general tree , if is T-TP, all the submatrices of associated with the deletion of pendant vertices are -matrices, and , then the smallest eigenvalue has an eigenvector signed according to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · graph theory and CDMA systems
