Generalization of pinching operation to binary matroids

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Vahid Ghorbani¹  Ghodratollah Azadi¹  Habib Azanchiler¹ 

[1] Department of Mathematics, Urmia University

关键词: Binary matroid;    Connectivity;    Pinching;    Splitting;    Splitting off;    Element splitting;   

DOI  :  10.13069/jacodesmath.784992

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

In this paper, we generalize the pinching operation on two edges of graphs to binary matroids andinvestigate some of its basic properties. For n ≥ 2, the matroid that is obtained from an n-connectedmatroid by this operation is a k-connected matroid with k ∈ {2, 3, 4} or is a disconnected matroid.We find conditions to guarantee this k. Moreover, we show that Eulerian binary matroids are characterized by this operation and we also provide some interesting applications of this operation.

【 授权许可】

CC BY