Abstract
Abstract In [3], the authors have extended the splitting operation of graphs to binary matroids. In this paper we explore the relationship between the splitting operation and connectedness in binary matroids. We prove that repeated applications of splitting operation on a bridgeless disconnected binary matroid leads to a connected binary matroid. We extend splitting lemma of graphs [1] to binary matroids.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have