EXTENDING THE NOTION OF 3-FOLD-3-POINT-SPLITTING FROM GRAPHS TO BINARY MATROIDS

被引：0

作者：

Ghafari, G. ^{[1
]}

Azadi, G. ^{[1
]}

Azanchiler, H. ^{[1
]}

机构：

[1] Urmia Univ, Dept Math, Orumiyeh, Iran

来源：

TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS | 2021年 / 11卷 / 03期

关键词：

Binary matroid; n-connected matroid; splitting operation; r-fold-n-point-splitting; cocircuit;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Slater defined r-fold-n-point-splitting operation on graphs and proved that, if G is an n-connected graph and H is a graph obtained from G by an r-fold-n-point-splitting, then H is n-connected. In this article we extend this notions from graphs to binary matroids and give some similar results to matroids. Moreover, we examine the Eulerianity of the resulting matroid obtained by this operation when the original matriod is Eulerian.

引用

页码：730 / 738

页数：9

共 12 条

[1] Azadi G., 2001, Generalized splitting operation for binary matroids and related results
[2] On n-connected splitting matroids
Borse, Y. M.
Mundhe, Ganesh
[J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2019, 16 (01) : 50 - 56
[3] Dalvi Kiran, 2009, Discussiones Mathematicae Graph Theory, V29, P629, DOI 10.7151/dmgt.1469
[4] Fleischner, 1990, EULERIAN GRAPHS RELA
[5] Counting 2-connected deletion-minors of binary matroids
Jackson, Bill
[J]. DISCRETE MATHEMATICS, 2013, 313 (11) : 1262 - 1266
[6] Mundhe G, J COMB MATH COBM COM
[7] Oxley James, 2011, Matroid Theory., V2nd
[8] Splitting in a binary matroid
Raghunathan, TT
Shikare, MM
Waphare, BN
[J]. DISCRETE MATHEMATICS, 1998, 184 (1-3) : 267 - 271
[9] Shikare M. M., 2011, J. Indian Math. Soc, V78, P145
[10] Slater P. J., 1974, Journal of Combinatorial Theory, Series B, V17, P281, DOI 10.1016/0095-8956(74)90034-3

← 1 2 →