A Class ofM-matrices whose Graphs are Trees

DOI10.1080/03081080410001667816zbMath1064.15030OpenAlexW2005783147MaRDI QIDQ4822839

Jaime San Martín, Servet Martínez, Xiao Dong Zhang

Publication date: 25 October 2004

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080410001667816

zbMATH Keywords

tree\(M\)-matrixinverse \(M\)-matrixgeneralized ultrametric matrix

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (1)

\(LU\)-factorization versus Wiener-Hopf factorization for Markov chains

Cites Work

• Notes on inverse M-matrices
• A conjecture concerning the Hadamard product of inverses of \(M\)-matrices
• Treediagonal matrices and their inverses
• Inverse M-matrices
• The inverse M-matrix problem
• Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach
• Inverse \(M\)-matrix inequalities and generalized ultrametric matrices
• Generalized ultrametric matrices -- a class of inverse \(M\)-matrices
• Ultrametric matrices and induced Markov chains
• Special Ultrametric Matrices and Graphs
• On Green's Matrices of Trees
• Inverse tridiagonalZ-Martices^∗
• Inverse of Strictly Ultrametric Matrices are of Stieltjes Type
• A Linear Algebra Proof that the Inverse of a Strictly Ultrametric Matrix is a Strictly Diagonally Dominant Stieltjes Matrix
• Inverses of Unipathic M-Matrices

This page was built for publication: A Class ofM-matrices whose Graphs are Trees