On the core-nilpotent decomposition of trees

DOI10.1016/j.laa.2018.10.012zbMath1407.05051OpenAlexW2895853178WikidataQ129054448 ScholiaQ129054448MaRDI QIDQ1713307

Daniel A. Jaume, Rodrigo Sota

Publication date: 24 January 2019

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

Full work available at URL: https://doi.org/10.1016/j.laa.2018.10.012

zbMATH Keywords

maximum independent setstreescore-nilpotent decompositionmaximum matchingsnull decomposition of trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Decompositions of matrices into diagonalizable and square-zero matrices ⋮ Decompositions of matrices into potent and square-zero matrices ⋮ On Some Decompositions of Matrices over Algebraically Closed and Finite Fields ⋮ Certain Properties of Square Matrices over Fields with Applications to Rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Null decomposition of trees
• A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
• On simply structured bases of tree kernels
• A characterization of singular graphs

This page was built for publication: On the core-nilpotent decomposition of trees