Arc reversals of cycles in orientations of $G$ vertex-multiplications
W.H.W. Wong, E.G. Tay

TL;DR
This paper extends known equivalence results for tournaments and bipartite tournaments to orientations of vertex-multiplied graphs, using advanced techniques to analyze score list and parity properties.
Contribution
It introduces new methods to analyze cycle reversals in orientations of vertex-multiplied graphs, generalizing previous results to broader graph classes.
Findings
Established $C_3$-equivalence for orientations with same score list.
Proved $C_4$-equivalence for bipartite orientations with same score lists.
Developed new extension and reduction techniques for cycle analysis.
Abstract
Ryser proved that any two tournaments with the same score sequence are -equivalent while Beineke and Moon proved the -equivalence for any two bipartite tournaments with the same score lists. In this paper, we extend these results to orientations of vertex-multiplications. We focus on two main areas, namely orientations with the same score list and with score-list parity. Our main tools are extensions of the refinement technique, directed difference graph and a reduction lemma.
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Limits and Structures in Graph Theory
