对称的完全二部多重有向图的P7⇀-因子分解
P7⇀-Factorization of Symmetric Complete Bipartite Multi-Digraphs
摘要:
如果对称完全二部多重有向图
λK
m,n*的有向弧集可以分拆为
λKm,n*的
Pk⇀-因子，则称
λKm,n*存在
Pk⇀-因子分解。对称完全二部多重有向图
λKm,n*存在
P7⇀-因子分解的充分必要条件是：1) 3m≤4n，2) 3n≤4m，3) m+n≡0(mod7)，4) 7λmn/[3(m,n)]是整数。
Abstract:
A Pk⇀-factorization λKm,n* is a set of arc-disjoint Pk⇀-factors of λKm,n*. A necessary and sufficient condition for P7⇀-factorization of λKm,n* is that: 1) 3m≤4n, 2) 3n≤4m, 3) m+n≡0(mod7) and 4) 7λmn/[3(m,n)].
参考文献
|
[1]
|
Ushio, K. (1993) G-Designs and Related Designs. Discrete Mathematics, 116, 299-311. [Google Scholar] [CrossRef]
|
|
[2]
|
Harary, F. (1972) Graph Theory. Addison-Wesley, Massachusetts.
|
|
[3]
|
Chartrand, G. and Lesniak, L. (1986) Graphs and Digraphs. 2nd Edition, Wadsworth, California.
|
|
[4]
|
Wang, H. (1993) P2k-Factorization of Complete Bipartite Graph. Discrete Mathematics, 120, 307-308. [Google Scholar] [CrossRef]
|
|
[5]
|
Du, B.L. (2000) P2k-Factorization of Complete Bipartite Multigraphs. The Australasian Journal of Combinatorics, 21, 275-278.
|
|
[6]
|
Ushio, K. (1988) P3-Factorization of Complete Bipartite Graphs. Discrete Mathematics, 72, 361-366. [Google Scholar] [CrossRef]
|
|
[7]
|
Du, B.L. (2003) -Factorization of Complete Bipartite Symmetric Digraphs. The Australasian Journal of Combinatorics, 19, 275-278.
|
|
[8]
|
Wang, J. and Du, B.L. (2003) -Factorization of Complete Bipartite Multigraphs and Symmetric Complete Bipartite Multi-Digraphs. Utilitas Mathematic, 63, 213-228.
|
|
[9]
|
Wang, J. and Du, B.L. (2005) -Factorization of Symmetric Complete Bipartite Multi-Digraphs. Utilitas Mathematic, 79, 129-137.
|