Generalized Splitting and element splitting operations on $p$-matroids
Sachin Gunjal, Uday Jagadale, Prashant Malavadkar
Abstract
Open-access reader
Sachin Gunjal, Uday Jagadale, Prashant Malavadkar
Abstract
Open-access reader
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 and bases of the original matroid, respectively. A class of $n$-connected $p$-matroids which gives n-connected $p$- matroids using the generalized splitting operation is also characterized. We also prove that connectivity of $p$-matroid is preserved under element splitting operation. Sufficient conditions to obtain Eulerian $p$-matroid from Eulerian $p$-matroid under splitting and element splitting operations are provided.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 and bases of the original matroid, respectively. A class of $n$-connected $p$-matroids which gives n-connected $p$- matroids using the generalized splitting operation is also characterized. We also prove that connectivity of $p$-matroid is preserved under element splitting operation. Sufficient conditions to obtain Eulerian $p$-matroid from Eulerian $p$-matroid under splitting and element splitting operations are provided.
Key concepts: Matroid, Element (criminal law), Graphic matroid, Combinatorics, Eulerian path, Mathematics, Matroid partitioning, Discrete mathematics