English

On the characterization of Eulerian $es$-splitting $p$-matroids

Combinatorics 2022-11-29 v2

Abstract

The eses-splitting operation on binary bridge-less matroids never produces an Eulerian matroid. But for matroids representable over GF(p),(p>2),GF(p),(p>2), called pp-matroids, the eses-splitting operation may yield Eulerian matroids. In this work, we introduce the eses-splitting operation for pp-matroids and characterize a class of pp-matroids yielding Eulerian matroids after the eses-splitting operation. Characterization of circuits, and bases of the resulting matroid, after the eses-splitting operation, in terms of circuits, and bases of the original matroid, respectively, are discussed. We also proved that the eses-splitting operation on pp-matroids preserves connectivity and 3-connectedness. Sufficient condition to obtain Hamiltonian pp-matroid from Hamiltonian pp-matroid under eses-splitting operation is also provided.

Keywords

Cite

@article{arxiv.2205.03180,
  title  = {On the characterization of Eulerian $es$-splitting $p$-matroids},
  author = {Uday Jagadale and Prashant Malavadkar and Sachin Gunjal and M. M. Shikare},
  journal= {arXiv preprint arXiv:2205.03180},
  year   = {2022}
}