Null decomposition and a combinatorial-block generalized inversion of trees
The Electronic Journal of Linear Algebra · 04.06.2026 · 42 · 499-521
DOI: 10.13001/ela.2026.10029 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Linear Algebra, online erschienen am 04.06.2026. Verfasst von Daniel A. Jaume und 3 weiteren Autor:innen.
Abstract (Originalsprache)
We study the Drazin inverse of the adjacency matrix of a tree \( T \) through its null decomposition. This decomposition, which partitions the vertex set of \( T \), reveals a close connection between the Drazin inverse and the matching and independence structures of the tree. In addition, we use a Bjerhammar-type condition for the Drazin inverse of a matrix.
Zitieren
APA
Jaume, D. A., Panelo, C., Sota, R., & Vega, M. E. (2026). Null decomposition and a combinatorial-block generalized inversion of trees. The Electronic Journal of Linear Algebra, 42, 499-521. https://doi.org/10.13001/ela.2026.10029
Vancouver
Jaume DA, Panelo C, Sota R, Vega ME. Null decomposition and a combinatorial-block generalized inversion of trees. The Electronic Journal of Linear Algebra. 2026;42:499-521. doi:10.13001/ela.2026.10029
BibTeX
@article{Jaume2026,
author = {Jaume, Daniel A. and Panelo, Cristian and Sota, Rodrigo and Vega, Micaela E.},
title = {Null decomposition and a combinatorial-block generalized inversion of trees},
journal = {The Electronic Journal of Linear Algebra},
year = {2026},
volume = {42},
pages = {499--521},
doi = {10.13001/ela.2026.10029}
}
EUVIMED