Abstract
In this paper, we generalize the splitting off operation on graphs to binary matroids and investigate the relations between the matroids resulting from this operation and the original binary matroids in terms of representation matrices, bases, rank functions and connectivity. We also provide some interesting applications of this operation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
