In this paper we consider the uniformly resolvable decompositions of the complete graph K_v, or the complete graph minus a1-factor as appropriate, into subgraphs such that eachresolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for thecase in which all the resolution classes consist of either P_3s or K_3s.

Uniformly resolvable decomposition of K_v into P_3 and K_3 graphs

MILICI, Salvatore;
2014-01-01

Abstract

In this paper we consider the uniformly resolvable decompositions of the complete graph K_v, or the complete graph minus a1-factor as appropriate, into subgraphs such that eachresolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for thecase in which all the resolution classes consist of either P_3s or K_3s.
2014
Resolvable graph decomposition; uniform resolution; 3-paths, 3-cycle
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/30725
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 19
social impact