Generalization of pinching operation to binary matroids
In this paper, we generalize the pinching operation on two edges of graphs to binary matroids and investigate some of its basic properties. For $n\geq 2$, the matroid that is obtained from an $n$-connected matroid by this operation is a $k$-connected matroid with $k\in\{2,3,4\}$ or is a disconnected...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yildiz Technical University
2020-09-01
|
| Series: | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/pub/jacodesmath/issue/56695/784992?publisher=yildiz |