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. Given a set Γ of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decompositionof a graph G is an edge decomposition of G into X-factors for some graph X ∈ Γ. In this article we completely solve the existence problem for decompositions of K_v-I into Cn-factors and K_1,n-factors in the case when n is even.

Uniformly resolvable decompositions of Kv-I into n-cycles and n-stars, for even n

G. Lo Faro;A. Tripodi
2020

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. Given a set Γ of pairwise non-isomorphic graphs, a uniformly resolvable Γ-decompositionof a graph G is an edge decomposition of G into X-factors for some graph X ∈ Γ. In this article we completely solve the existence problem for decompositions of K_v-I into Cn-factors and K_1,n-factors in the case when n is even.
File in questo prodotto:
File Dimensione Formato  
Uniformly Resolvable Decompositions of K_v-I into n-cycles and n-stars, for even n .pdf

accesso aperto

Descrizione: Articolo Principale
Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 768.79 kB
Formato Adobe PDF
768.79 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento 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: http://hdl.handle.net/11570/3179637
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact