Let Kv denote the complete graph of order v and Kv I denoteKv minus a 1-factor. In this article we investigate uniformly resolvabledecompositions of Kv and KvI into r classes containing only copies of3-stars and s classes containing only copies of 3-cycles. We completelydetermine the spectrum in the case where the number of resolutionclasses of 3-stars is maximum.

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

MILICI, Salvatore;
2015

Abstract

Let Kv denote the complete graph of order v and Kv I denoteKv minus a 1-factor. In this article we investigate uniformly resolvabledecompositions of Kv and KvI into r classes containing only copies of3-stars and s classes containing only copies of 3-cycles. We completelydetermine the spectrum in the case where the number of resolutionclasses of 3-stars is maximum.
Resolvable graph decomposition; uniform resolution; paths, 3-stars
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/16575
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? ND
social impact