Related papers: The Closure Operator of es-Splitting Matroids
The $es$-splitting operation on binary bridge-less matroids never produces an Eulerian matroid. But for matroids representable over $GF(p),(p>2),$ called $p$-matroids, the $es$-splitting operation may yield Eulerian matroids. In this work,…
The r-fold-n-point-splitting operation is an important operation in Graph Theory defined by Slater [15]. Later, Ghafari [6] extended 3-fold-n-point-splitting operation in binary matroids and obtained the result for Eulerian matroids whose…
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.…
Raghunathan at al. [9] introduced splitting operation with respect to a pair of element for binary matroid and characterized Eulerian binary matroids using it. In general, the splitting operation does not preserve the graphicness property…
We study the closure operators of polymatroids from a lattice theoretic point of view. We show that polymatroid closure operators relate to lattices enriched with a generating set in the same way that matroids relate to geometric lattices.…
In this paper, we define generalized splitting and element splitting operations on $p$-matroids. $p$-matroids are the matroids representable over $GF(p).$ The circuits and the bases of the new matroid are characterized in terms of circuits…
Slater introduced the point-addition operation on graphs to classify 4-connected graphs. The $\Gamma$-extension operation on binary matroids is a generalization of the point-addition operation. In this paper, we obtain necessary and…
Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets…
Let $EX[M_1\dots, M_k]$ denote the class of binary matroids with no minors isomorphic to $M_1, \dots, M_k$. In this paper we give a decomposition theorem for $EX[S_{10}, S_{10}^*]$, where $S_{10}$ is a certain 10-element rank-4 matroid. As…
Our splitter theorem for internally 4-connected binary matroids studies pairs of the form (M,N), where N and M are internally 4-connected binary matroids, M has a proper N-minor, and if M' is an internally 4-connected matroid such that M…
We extend the splitting operation from binary matroids (Raghunathan et al., 1998) to $p$- matroids, where $p$-matroids refer to matroids representable over $GF(p).$ We also characterize circuits, bases, and independent sets of the resulting…
A matroid $N$ is a lift of a binary matroid $M$, if $N=Q\backslash X$ when $Q/X=M$ for some binary matroid $Q$ and $X \subseteq E(Q)$ and is called an elementary lift of $M$, if $|X|=1$. A splitting operation on a binary matroid can result…
Zaslavsky introduced the concept of lifted-graphic matroid. For binary matroids, a binary elementary lift can be defined in terms of the splitting operation. In this paper, we give a method to get a forbidden-minor characterization for the…
The splitting operation on a $p$-matroid does not necessarily preserve connectivity. It is observed that there exists a single element extension of the splitting matroid which is connected. In this paper, we define the element splitting…
In general, the splitting operation on binary matroids does not preserve the graphicness and cographicness properties of binary matroids. In this paper, we obtain a characterization of the class of graphic matroids whose splitting with…
This paper provides a general operadic definition for the notion of splitting the operations of algebraic structures. This construction is proved to be equivalent to some Manin products of operads and it is shown to be closely related to…
The main result is Theorem MAT 11 which states that every finite closure operator is the ground set of a matroid. Its base sets consist of nonredundant covers of of the closure. These are minimal subsets that determine the closure operator…
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…
Operator splitting methods allow to split the operator describing a complex dynamical system into a sequence of simpler subsystems and treat each part independently. In the modeling of dynamical problems, systems of (possibly coupled)…
Recently, in order to broad the application and theoretical areas of rough sets and matroids, some authors have combined them from many different viewpoints, such as circuits, rank function, spanning sets and so on. In this paper, we…