TY - JOUR
T1 - Balanced bipartite 4-cycle designs
AU - Fu, Hung-Lin
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Let (λ1, λ2, λ3)Kv1,v2 denote the graph G with V(G) = V1 ∪ V2, V1 ∩ V2 = 0, |V1| =v1, |V2| = v2, and the edges of G are obtained by joining (a) each pair of vertices in Vi, i = 1,2, exactly λi times and (b) each pair of vertices from V1 to V2 exactly λ3 times. In this paper, we determine all quintuples (λ1, λ2, λ3; v1, v2) such that (λ1, λ2, λ3)Kv1,v2 can be decomposed into 4- cycles.
AB - Let (λ1, λ2, λ3)Kv1,v2 denote the graph G with V(G) = V1 ∪ V2, V1 ∩ V2 = 0, |V1| =v1, |V2| = v2, and the edges of G are obtained by joining (a) each pair of vertices in Vi, i = 1,2, exactly λi times and (b) each pair of vertices from V1 to V2 exactly λ3 times. In this paper, we determine all quintuples (λ1, λ2, λ3; v1, v2) such that (λ1, λ2, λ3)Kv1,v2 can be decomposed into 4- cycles.
UR - http://www.scopus.com/inward/record.url?scp=84885941890&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:84885941890
VL - 32
SP - 3
EP - 26
JO - Australasian Journal of Combinatorics
JF - Australasian Journal of Combinatorics
SN - 1034-4942
ER -