Some characterizations of symmetric inverse \(M\)-matrices

DOI10.1016/S0024-3795(97)10022-2zbMath0934.15026OpenAlexW2091808351MaRDI QIDQ1307202

Miroslav Fiedler

Publication date: 28 October 1999

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(97)10022-2

zbMATH Keywords

weighted graphinverse \(M\)-matrixelectrical networkdiagonally dominantultrametric matrix\(n\)-simplex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (12)

Resistance distances on networks ⋮ Potentials of random walks on trees ⋮ Boundary Value Problems on Finite Networks ⋮ Algorithmic techniques for finding resistance distances on structured graphs ⋮ Total positivity in multivariate extremes ⋮ On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem ⋮ A combinatorial expression for the group inverse of symmetric \(M\)-matrices ⋮ Resistance distances in extended or contracted networks ⋮ Inverse \(M\)-matrices. II ⋮ Characterization of symmetric \(M\)-matrices as resistive inverses ⋮ Inverse \(M\)-matrix, a new characterization ⋮ Effective resistance is more than distance: Laplacians, simplices and the Schur complement

Cites Work

• Characteristic vertices of weighted trees via perron values
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some characterizations of symmetric inverse \(M\)-matrices