Locally Balanced G-Designs

Paola Bonacini (), Mario Gionfriddo and Lucia Marino
Additional contact information
Paola Bonacini: Dipartimento di Matematica e Informatica, Università di Catania, 95125 Catania, Italy
Mario Gionfriddo: Dipartimento di Matematica e Informatica, Università di Catania, 95125 Catania, Italy
Lucia Marino: Dipartimento di Matematica e Informatica, Università di Catania, 95125 Catania, Italy

Mathematics, 2023, vol. 11, issue 2, 1-8

Abstract: Let G be a graph and let K n be the complete graph of order n . A G -design is a decomposition of the set of edges of K n in graphs isomorphic to G , which are called blocks . It is well-known that a G -design is balanced if all the vertices are contained in the number of blocks of G . In this paper, the definition of locally balanced G-design is given, generalizing the existing concepts related to balanced designs. Further, locally balanced G-designs are studied in the cases in which G ≅ C 4 + e and G ≅ C 4 + P 3 , determining the spectrum.

Keywords: G-designs; balanced; spectrum (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/2/408/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/2/408/ (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:11:y:2023:i:2:p:408-:d:1033939

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 ().