Uniformly Resolvable Decompositions of K v - I into n -Cycles and n -Stars, for Even n

Giovanni Lo Faro, Salvatore Milici and Antoinette Tripodi
Additional contact information
Giovanni Lo Faro: Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy
Salvatore Milici: Dipartimento di Matematica e Informatica, Università di Catania, 95131 Catania, Italy
Antoinette Tripodi: Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy

Mathematics, 2020, vol. 8, issue 10, 1-9

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 Γ -decomposition of 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 C n -factors and K 1 , n -factors in the case when n is even.

Keywords: graph decomposition; factor; uniform factorization (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/10/1755/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/10/1755/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:10:p:1755-:d:426866

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().