Let Kv be the complete graph of order v and F be a set of 1-factors of Kv . In this article we study the existence of a resolvable decomposition of Kv − F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1-factors, with the possible exception of v ∈ {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}.

Resolvable 3-star designs

MILICI, Salvatore;
2015

Abstract

Let Kv be the complete graph of order v and F be a set of 1-factors of Kv . In this article we study the existence of a resolvable decomposition of Kv − F into 3-stars when F has the minimum number of 1-factors. We completely solve the case in which F has the minimum number of 1-factors, with the possible exception of v ∈ {40, 44, 52, 76, 92, 100, 280, 284, 328, 332, 428, 472, 476, 572}.
Resolvable graph decomposition; Uniform resolutions; 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/16679
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 12
social impact