Null decomposition and a combinatorial-block generalized inversion of trees

DOI10.13001/ELA.2026.10029MaRDI QIDQ7299992zbMATH OpenFDO

Authors Daniel A. Jaume, Cristian Panelo, Rodrigo Sota, Micaela E. Vega

Publication date 20 July 2026

Published in ELA. The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13001/ELA.2026.10029

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Theory of matrix inversion and generalized inverses (15A09)

Review text

The paper shows a very deep connection between the Drazin inverse of the adjacency matrix of a tree and the null decomposition, matching and independence structures of the tree.

Cites work

• \(\{-1,0,1\}\)-basis for the null space of a forest
• A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
• Drazin inverse of singular adjacency matrices of directed weighted cycles
• Graphs and matrices
• Graphs with unique maximum independent sets
• scientific article; zbMATH DE number 3681810 (Why is no real title available?)
• scientific article; zbMATH DE number 3708571 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• Inverses of trees
• Inverting non-invertible labeled trees
• Matching theory
• Null decomposition of trees
• On nonsingular trees and a reciprocal eigenvalue property
• On simply structured bases of tree kernels
• On the inverse and the dual index of a tree
• On the null-spaces of acyclic and unicyclic singular graphs
• The Moore-Penrose inverse of matrices with an acyclic bipartite graph
• Trees with a unique maximum independent set and their linear properties

This page was built for publication: Null decomposition and a combinatorial-block generalized inversion of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299992)