Abstract
Raghunathan et al. [Splitting in a binary matroid, Discrete Math. 184 (1998), 267–271] have generalized the splitting operation on graphs to binary matroids. Given a binary matroid M and a pair x, y of its elements the dual of the splitting matroid (M* x,y ) need not be same as the splitting of dual matroid (M* x,y ). Luis A. Goddyn (1997, personel communication) posed a problem that dual of a splitting matroid is not always equal to the splitting of dual of the original matroid so, can we characterize those binary matroids, in which both are the same? In this paper, we characterize those binary matroids M for which the two matroids will be same for a given pair of its elements.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Fleischner, Eulerian Graphs and Related Topics, Part 1, Vol. 1 (North Holland, Amsterdam, 1990).
G. Oxley, Matroid Theory, (Oxford University Press, Oxford, 1992).
T. T. Raghunathan, M.M. Shikare, and B. N. Waphare, Discrete Math. 184, 267 (1998).
M.M. Shikare and G. Azadi, European J. Combin. 24, 45 (2003).
M. M. Shikare and B. N. Waphare, Ars Combinatoria 97, 111 (2010).
P. J. Slater, J.Combin. Theory 17, 282 (1974).
W. T. Tutte, Indag. Math. 23, 441 (1961).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dhotre, S.B. A note on the dual of the splitting matroid. Lobachevskii J Math 33, 229–231 (2012). https://doi.org/10.1134/S1995080212030134
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080212030134