Matroids that classify forests

zbMATH Open1498.05048arXiv2009.03299MaRDI QIDQ5047015FDOQ5047015

Authors:

Publication date: 9 November 2022

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

Full work available at URL: https://arxiv.org/abs/2009.03299

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)

Cites Work

• Title not available (Why is that?)
• Rank-width and vertex-minors
• Decomposition of Directed Graphs
• Graphic presentations of isotropic systems
• Greedy algorithm and symmetric matroids
• Isotropic systems
• Multimatroids I. Coverings by Independent Sets
• Transforming trees by successive local complementations
• Binary matroids and local complementation
• Isotropic matroids. I: Multimatroids and neighborhoods

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)