Trees with matrix weights: Laplacian matrix and characteristic-like vertices (Q2134567)

For a given tree \(T\) with positive weights on its edges, an interesting result that gives some insight into the structure of the eigenvectors corresponding to the algebraic connectivity of \(T\) is obtained. The trees (type I and type II) of the characteristic vertices of trees and their relations with algebraic connectivity have created a great deal of interest amongst researchers, and many interesting results have been obtained for such trees. An alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches is helpful. Moreover, the algebraic connectivity of a tree with positive edge weights can be expressed in terms of Perron values. Trees with matrix weights on their edges are considered. Mainly, the authors are interested in trees with the following classes of matrix edge weights: 1. positive definite matrix weights, 2. lower (or upper) triangular matrix weights with positive diagonal entries. For trees with the above classes of matrix edge weights, the authors define Perron values and Perron branches. Further, they establish the existence of vertices satisfying properties analogous to the properties of characteristic vertices of trees with positive edge weights in terms of Perron values and Perron branches, and they name such vertices characteristic-like vertices. In this case, the eigenvalues of the Laplacian matrix are nonnegative, and a lower bound for the first nonzero eigenvalue of the Laplacian matrix in terms of Perron value is obtained. Furthermore, the Moore-Penrose inverse of the Laplacian matrix of a tree with nonsingular matrix weights on its edges is computed. The article shows many interesting results on characterizations and inequalities. This article is useful to interdisciplinary researchers working in the fields of computer science as well as discrete mathematics.