Back to Search
Start Over
On n-connected minors of the es-splitting binary matroids
- Source :
- Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 265-275 (2021)
- Publication Year :
- 2021
- Publisher :
- The Institute for Research and Community Services (LPPM) ITB, 2021.
-
Abstract
- The es-splitting operation on an n-connected binary matroid may not yield an n-connected matroid for (n ≥ 3). In this paper, we show that given an n-connected binary matroid M of rank r, the resulting es-splitting binary matroid has an n-connected minor of rank-(r + 1) having |E(M)| + 1 elements.
- Subjects :
- graph, binary matroids, es-splitting operation
Applied Mathematics
Minor (linear algebra)
MathematicsofComputing_GENERAL
Binary number
Matroid
Combinatorics
n-connected
QA1-939
Binary matroid
Computer Science::Programming Languages
Discrete Mathematics and Combinatorics
Rank (graph theory)
Mathematics
Subjects
Details
- ISSN :
- 23382287
- Volume :
- 9
- Database :
- OpenAIRE
- Journal :
- Electronic Journal of Graph Theory and Applications
- Accession number :
- edsair.doi.dedup.....1147655d337186b9a9ed232a257c1afc