标题：Weakly complementary cycles in a class of multipartite tournaments
作者机构：[He, Zhihong ] School of Computer Science and Technology, Shandong University, Jinan, China;[He, Zhihong ] School of Mathematics and Information Scien 更多
会议名称：2010 International Conference on Educational and Network Technology, ICENT 2010
会议日期：25 June 2010 through 27 June 2010
来源：ICENT 2010 - 2010 International Conference on Educational and Network Technology
关键词：Complementary cycles; Multipartite tournaments; Weakly complementary cycles
摘要：The problem of complementary cycles in tourname-nts and bipartite tournaments was completely solved. However, the problem of complementary cycles in semicomplete n -partite digraphs with n ≥ 3 is still open. Based on the definition of weakly complementary cycles, we get the following result. Let D be a 2 -strong n-partite tournament that is not a tournament, where n ≥ 6. Let C be a 3 -cycle of D and D-V(C) be nonstrong. For the unique acyclic sequence D1, D2, · · ·, D α of D-V(C), where α ≥ 2, if | V(Dα+l-i) |= 1, D i contains cycles for i = 1 or i = α, then D contains a pair of weakly complementary cycles. © 2010 IEEE.