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 Kv is an edge decomposition of Kv into exactly r X-factors and s Y-factors. In this article we determine necessary and sufficient conditions for when the complete graph Kv has a uniformly resolvable decompositions into 1-factors and K1,4-factors
Titolo: | Uniformly resolvable decompositions of Kv in 1-factors and n-stars |
Autori interni: | |
Data di pubblicazione: | 2020 |
Rivista: | |
Handle: | http://hdl.handle.net/20.500.11769/374080 |
Appare nelle tipologie: | 1.1 Articolo in rivista |
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.