If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. A uniformly resolvable {X,Y}-decomposition of the complete graph K_v is an edge decomposition of K_v into exactly r X-factors and s Y -factors. In this article we determine necessary and sufficient conditions for when the complete graph K_v has a uniformly resolvable decompositions into 1-factors and K_{1,4}-factors.

Uniformly resolvable decompositions of kv in 1-factors and 4-stars

Tripodi A.
2020-01-01

Abstract

If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. A uniformly resolvable {X,Y}-decomposition of the complete graph K_v is an edge decomposition of K_v into exactly r X-factors and s Y -factors. In this article we determine necessary and sufficient conditions for when the complete graph K_v has a uniformly resolvable decompositions into 1-factors and K_{1,4}-factors.
2020
File in questo prodotto:
File Dimensione Formato  
ajc_v76_p055.pdf

accesso aperto

Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 166.57 kB
Formato Adobe PDF
166.57 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

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/11570/3150010
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 6
social impact