On the characterization of Eulerian $es$-splitting $p$-matroids
Uday Jagadale, Prashant Malavadkar, Sachin Gunjal, and M.M.Shikare

TL;DR
This paper introduces and characterizes the $es$-splitting operation for $p$-matroids, identifying conditions under which it produces Eulerian matroids and analyzing its effects on connectivity and Hamiltonicity.
Contribution
It extends the $es$-splitting operation to $p$-matroids, providing a characterization of when it yields Eulerian matroids and how it affects connectivity and Hamiltonian properties.
Findings
$es$-splitting can produce Eulerian $p$-matroids under certain conditions.
Connectivity and 3-connectedness are preserved by $es$-splitting.
Conditions for Hamiltonian $p$-matroids after $es$-splitting are established.
Abstract
The -splitting operation on binary bridge-less matroids never produces an Eulerian matroid. But for matroids representable over called -matroids, the -splitting operation may yield Eulerian matroids. In this work, we introduce the -splitting operation for -matroids and characterize a class of -matroids yielding Eulerian matroids after the -splitting operation. Characterization of circuits, and bases of the resulting matroid, after the -splitting operation, in terms of circuits, and bases of the original matroid, respectively, are discussed. We also proved that the -splitting operation on -matroids preserves connectivity and 3-connectedness. Sufficient condition to obtain Hamiltonian -matroid from Hamiltonian -matroid under -splitting operation is also provided.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Complexity and Algorithms in Graphs
