TY - JOUR
T1 - Isomorphic path decompositions of crowns
AU - Shyu, Tay Woei
AU - Lin, Chiang
PY - 2003/4
Y1 - 2003/4
N2 - For positive integers k ≤ n. the crown Cn,k is the graph with vertex set {a1, a2,...,an, b1, b2,...,bn}and edge set {aibj: 1 ≤ i ≤ n, j = i, i + 1,...,i + k - 1 (mod n)}. In this paper we give a necessary and sufficient condition for the existence of PI decomposition of Cn,k.
AB - For positive integers k ≤ n. the crown Cn,k is the graph with vertex set {a1, a2,...,an, b1, b2,...,bn}and edge set {aibj: 1 ≤ i ≤ n, j = i, i + 1,...,i + k - 1 (mod n)}. In this paper we give a necessary and sufficient condition for the existence of PI decomposition of Cn,k.
UR - http://www.scopus.com/inward/record.url?scp=14944365837&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=14944365837&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:14944365837
SN - 0381-7032
VL - 67
SP - 97
EP - 103
JO - Ars Combinatoria
JF - Ars Combinatoria
ER -