A note on connectivity of splitting matroids
Combinatorics
2018-09-28 v1
Abstract
Fleischner introduced the idea of splitting a vertex of degree at least three in a connected graph and used the operation to characterize Eulerian graphs. Raghunathan et. al. extended the splitting operation from graphs to binary matroids. It has been studied that splitting operation, in general, may not preserve the connectedness of the binary matroid. Interestingly, it is true that the splitting matroid of a disconnected matroid may be connected. In this paper, we characterize the binary disconnected matroids whose splitting matroid is connected.
Keywords
Cite
@article{arxiv.1809.10592,
title = {A note on connectivity of splitting matroids},
author = {S. B. Dhotre and P. P. Malavadkar},
journal= {arXiv preprint arXiv:1809.10592},
year = {2018}
}