On uniformly resolvable {K1,2, K1,3}-designs

Authors

DOI:

https://doi.org/10.1478/AAPP.96S2A9

Keywords:

Resolvable Graph Decomposition, Uniformly Resolvable Designs, Stars

Abstract

Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the edges of Kv into isomorphic copies of graphs from H (also called blocks) in such a way that all blocks in a given parallel class are isomorphic to the same graph from H. We consider the case H={K1,2, K1,3} and prove that the necessary conditions on the existence of such designs are also sufficient.

Author Biographies

  • Giovanni Lo Faro, Università degli Studi di Messina
    Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra
  • Salvatore Milici, Università di Catania
    Dipartimento di Matematica e Informatica
  • Antoinette Tripodi, Università degli Studi di Messina
    Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra

Downloads

Published

2018-11-20

Issue

Vol 96, SUPPL NO 2 (2018): HyGraDe 2017

Section

HyGraDe 2017 (Conference Proceedings)

License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).