Distances in Weighted Trees and Group Inverse of Laplacian Matrices
Authors:
- Stephen J. KirklandSKStephen J. Kirkland
- Michael NeumannMNMichael Neumann
- Bryan L. ShaderBSBryan L. Shader
- 1 October 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 18 (4) , 827-841
Abstract
In this paper we find formulas for group inverses of Laplacians of weighted trees. We then develop a relationship between entries of the group inverse and various distance functions on trees. In particular, we show that the maximal and minimal entries on the diagonal of the group inverse correspond to certain pendant vertices of the tree and to a centroid of the tree, respectively. We also give a characterization for the group inverses of the Laplacian of an unweighted tree to be an M-matrix.Keywords
This publication has 10 references indexed in Scilit:
- Existence of Generalized Inverse of Linear Transformations over Finite FieldsFinite Fields and Their Applications, 1998
- Bounds on the subdominant eigenvalue involving group inverse with applications to graphsCzechoslovak Mathematical Journal, 1998
- Characteristic vertices of weighted trees via perron valuesLinear and Multilinear Algebra, 1996
- Group generalized inverses of M-matrices associated with periodic and nonperiodic jacobi matricesLinear and Multilinear Algebra, 1995
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- Nonnegative Matrices in the Mathematical Sciences1994
- Derivatives of the Perron root at an essentially nonnegative matrix and the group inverse of an M-matrixJournal of Mathematical Analysis and Applications, 1984
- A Combinatorial Proof of the All Minors Matrix Tree TheoremSIAM Journal on Algebraic Discrete Methods, 1982
- The symmetrization of matrices by diagonal matricesJournal of Mathematical Analysis and Applications, 1962
- Status and ContrastatusSociometry, 1959