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

Selda Küçükçifçi, Salvatore Milici, Z. Tuza

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number9863
Pages (from-to)1667-1673
Number of pages7
JournalDiscrete Mathematics
Volume338
Issue number10
DOIs
Publication statusPublished - May 31 2015

Fingerprint

Stars
Star
Decomposition
Cycle
Decompose
Denote
Complete Graph
Class

Keywords

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

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Maximum uniformly resolvable decompositions of Kv and Kv - I into 3-stars and 3-cycles. / Küçükçifçi, Selda; Milici, Salvatore; Tuza, Z.

In: Discrete Mathematics, Vol. 338, No. 10, 9863, 31.05.2015, p. 1667-1673.

Research output: Contribution to journalArticle

Küçükçifçi, Selda ; Milici, Salvatore ; Tuza, Z. / Maximum uniformly resolvable decompositions of Kv and Kv - I into 3-stars and 3-cycles. In: Discrete Mathematics. 2015 ; Vol. 338, No. 10. pp. 1667-1673.
@article{1066122a9f854cbfb1cc2c9f117ffd1a,
title = "Maximum uniformly resolvable decompositions of Kv and Kv - I into 3-stars and 3-cycles",
abstract = "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.",
keywords = "3-stars, Paths, Resolvable graph decomposition, Uniform resolutions",
author = "Selda K{\"u}{\cc}{\"u}k{\cc}if{\cc}i and Salvatore Milici and Z. Tuza",
year = "2015",
month = "5",
day = "31",
doi = "10.1016/j.disc.2014.05.016",
language = "English",
volume = "338",
pages = "1667--1673",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "10",

}

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 -