K_(m,n)~*的(?)_(2k)——因子分解

P_(2k)- Factorization Of Complete Bipartite Symmetric Digraphs

给出了完全二部对称有向图K*m,n存在P(→)2k-因子分解的充分必要条件为m=n≡0(mod k(2k-1)).

In this paper, it is show that a necessary and sufficient condition for the existence of a factorization of the complete bipartite symmetric digraph Km,n is m=n=0(mod k(2k - 1)).