### Abstract

Let K_{v} denote the complete graph of order v and K_{v} - I denote K_{v} minus a 1-factor. In this article we investigate uniformly resolvable decompositions of K_{v} and K_{v} - I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum.

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

Article number | 9863 |

Pages (from-to) | 1667-1673 |

Number of pages | 7 |

Journal | Discrete Mathematics |

Volume | 338 |

Issue number | 10 |

DOIs | |

Publication status | Published - May 31 2015 |

### Fingerprint

### Keywords

- 3-stars
- Paths
- Resolvable graph decomposition
- Uniform resolutions

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

_{v}and K

_{v}- I into 3-stars and 3-cycles.

*Discrete Mathematics*,

*338*(10), 1667-1673. [9863]. https://doi.org/10.1016/j.disc.2014.05.016

**Maximum uniformly resolvable decompositions of K _{v} and K_{v} - I into 3-stars and 3-cycles.** / Küçükçifçi, Selda; Milici, Salvatore; Tuza, Z.

Research output: Contribution to journal › Article

_{v}and K

_{v}- I into 3-stars and 3-cycles',

*Discrete Mathematics*, vol. 338, no. 10, 9863, pp. 1667-1673. https://doi.org/10.1016/j.disc.2014.05.016

_{v}and K

_{v}- I into 3-stars and 3-cycles. Discrete Mathematics. 2015 May 31;338(10):1667-1673. 9863. https://doi.org/10.1016/j.disc.2014.05.016

}

TY - JOUR

T1 - Maximum uniformly resolvable decompositions of Kv and Kv - I into 3-stars and 3-cycles

AU - Küçükçifçi, Selda

AU - Milici, Salvatore

AU - Tuza, Z.

PY - 2015/5/31

Y1 - 2015/5/31

N2 - Let Kv denote the complete graph of order v and Kv - I denote Kv minus a 1-factor. In this article we investigate uniformly resolvable decompositions of Kv and Kv - I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum.

AB - Let Kv denote the complete graph of order v and Kv - I denote Kv minus a 1-factor. In this article we investigate uniformly resolvable decompositions of Kv and Kv - I into r classes containing only copies of 3-stars and s classes containing only copies of 3-cycles. We completely determine the spectrum in the case where the number of resolution classes of 3-stars is maximum.

KW - 3-stars

KW - Paths

KW - Resolvable graph decomposition

KW - Uniform resolutions

UR - http://www.scopus.com/inward/record.url?scp=84930197623&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930197623&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2014.05.016

DO - 10.1016/j.disc.2014.05.016

M3 - Article

VL - 338

SP - 1667

EP - 1673

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 10

M1 - 9863

ER -