In this paper we consider the problem regarding the existence of uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the samegraph. We completely determine the spectrum for the case in which all the resolution classes are either P3 or P4.

Uniformly resolvable H-designs with H = {P_3, P_4}

GIONFRIDDO, Mario;MILICI, Salvatore
2014

Abstract

In this paper we consider the problem regarding the existence of uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the samegraph. We completely determine the spectrum for the case in which all the resolution classes are either P3 or P4.
Resolvable graph decompositions,; uniform resolutions, ; paths P_3, P_4
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: http://hdl.handle.net/20.500.11769/16892
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? ND
social impact