2021/12/01 by Prashant Malavadkar, Malavadkar, Prashant, Uday Jagadale +3
Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #graph theory and CDMA systems
paper · doi:10.48550/arxiv.2112.00437
openalex publication_date 2021/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 matroid. Sufficient conditions to yield Eulerian p-matroids from Eulerian and non-Eulerian p-matroids by applying the splitting operation are obtained. A class of connected p-matroids that gives connected p-matroids under the splitting operation is characterized.