### Abstract

For positive integers k ≤ n. the crown C_{n,k} is the graph with vertex set {a_{1}, a_{2},...,a_{n}, b_{1}, b_{2},...,b_{n}}and edge set {a_{i}b_{j}: 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 C_{n,k}.

Original language | English |
---|---|

Pages (from-to) | 97-103 |

Number of pages | 7 |

Journal | Ars Combinatoria |

Volume | 67 |

Publication status | Published - 2003 Apr 1 |

Externally published | Yes |

### ASJC Scopus subject areas

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Isomorphic path decompositions of crowns'. Together they form a unique fingerprint.

## Cite this

Shyu, T. W., & Lin, C. (2003). Isomorphic path decompositions of crowns.

*Ars Combinatoria*,*67*, 97-103.