Binary matroids that classify forests
Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.
Saved in:
| Date: | 2022 |
|---|---|
| Main Author: | Traldi, L. |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2022
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1759 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Partitions of groups and matroids into independent subsets
by: Banakh, Taras, et al.
Published: (2018) -
Partitions of groups and matroids into independent subsets
by: Banakh, Taras, et al.
Published: (2018) -
Hamming distance between the strings generated by adjacency matrix of a graph and their sum
by: Ganagi, Asha B., et al.
Published: (2016) -
Exact values of girth for some graphs \(D\left({k},{q}\right)\) and upper bounds of the order of cages
by: Pikuta, Piotr
Published: (2018) -
Conjugate Laplacian eigenvalues of co-neighbour graphs
by: Paul, S.
Published: (2022)