We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Locally Balanced G-Designs.
- Authors
Bonacini, Paola; Gionfriddo, Mario; Marino, Lucia
- 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.
- Subjects
COMPLETE graphs; BLOCK designs; DEFINITIONS
- Publication
Mathematics (2227-7390), 2023, Vol 11, Issue 2, p408
- ISSN
2227-7390
- Publication type
Article
- DOI
10.3390/math11020408