Abstract
Let G be a graph and let Kn be the complete graph of order n. A G-design is a decomposition of the set of edges of Kn 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≅C4+e and G≅C4+P3, determining the spectrum.
Funder
GNSAGA-INDAM
PIA.CE.RI. project of the University of Catania
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference9 articles.
1. Balanced and strongly balanced Pk-designs;Berardi;Discrete Math.,2012
2. Balanced and strongly balanced 4-kite designs;Gionfriddo;Util. Math.,2013
3. Degree- and orbit-balanced Γ-designs when Γ has five vertices;Bonvicini;J. Combin. Des.,2013
4. Tree-designs with balanced-type conditions;Bonisoli;Discrete Math.,2013
5. Balanced House-systems and Nestings;Bonacini;Ars Combin.,2015