Matroids that classify forests

MaRDI QIDQ5047015zbMATH OpenFDO

Authors

Publication date 9 November 2022

Full work available at URL https://arxiv.org/abs/2009.03299, https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1759

zbMATH Keywords

treeadjacency matrixmatroidforestpivotlocal equivalence

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.

Cites work

• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Binary matroids and local complementation
• Decomposition of Directed Graphs
• Graphic presentations of isotropic systems
• Greedy algorithm and symmetric matroids
• Isotropic matroids. I: Multimatroids and neighborhoods
• Isotropic systems
• Multimatroids I. Coverings by Independent Sets
• Rank-width and vertex-minors
• Transforming trees by successive local complementations

This page was built for publication: Matroids that classify forests

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