Abstract
The vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation of a complete c-partite graph. Let V 1, V 2, . . . ,V c be the partite sets of D. If there exist two vertex disjoint cycles C and C′ in D such that $${V_{\mathrm{i}}\cap(V(C)\cup V(C'))\neq\emptyset}$$ for all i = 1, 2, . . . , c, then D is weakly cycle complementary. In 2008, Volkmann and Winzen gave the above definition of weakly complementary cycles and proved that all 3-connected c-partite tournaments with c ≥ 3 are weakly cycle complementary. In this paper, we characterize multipartite tournaments are weakly cycle complementary. Especially, we show that all 2-connected 3-partite tournaments that are weakly cycle complementary, unless D is isomorphic to D 3,2, D 3,2,2 or D 3,3,1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
