Abstract
Let G be a graph and let be the complete graph of order n. A G-design is a decomposition of the set of edges of 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 and , determining the spectrum.
1. Introduction
Let , the complete graph having a vertex set X of v elements. Given a subgraph G of , it is well-known that a G-design of order v is a pair , such that the elements of are subgraphs of , all isomorphic to G. The elements of G are also called blocks and a G-design is also called a G-decomposition of .
Given a G-design , we denote by the degree of a vertex , which is the number of blocks of containing x. A G-design is called balanced if all the vertices of X have the same degree, i.e., if is constant for any vertex .
Let be a graph. An automorphism class of G is a subset , such that for every , there exists an automorphism of G, such that . We will denote by ,..., the automorphism classes of G.
Given a G-design and an automorphism class of G, we denote by the degree of a vertex , which is the number of blocks of containing x as an element of . The degree of an automorphism class is the degree of the vertices of G in .
It is well-known that a G-design is strongly balanced if, for every , all the vertices of X are contained in the blocks of the same number of times as element of , i.e., if, for every , there exists a constant , such that for every . In [1], the authors introduced the definition of strongly balanced G-design, as a particular balanced G-design, determining the spectrum in the case ( path with k vertices). Furthermore, the spectrum of strongly balanced -designs has been determined in [2]; in [3], the spectrum of strongly balanced G-designs has been determined for all graphs with five non-isolated vertices; in [4], balanced and strongly balanced G-designs are studied with the G tree with six vertices. Note that in [3] (in which the concept of orbit-balanced design is equivalent to strongly balanced design), the concept of degree-balanced G-design has been introduced. This means that the number of times that a vertex appears in a block as an element of degree d is constant for any degree d. The concept of balanced designs has been studied in relation with other designs, see, for example, [5,6], exploring also the case of hypergraph designs. In the case of hypergraphs, the notion of edge-balanced hypergraph designs has been introduced in [7].
Of course, a strongly balanced G-design is also a balanced G-design. In this paper, we introduce the new concepts of locally balanced and strictly balancedG-design.
The graphs that will be considered in this paper are the following:
- 1.
- the graph is the graph with vertex set and edge set ; we call it graph and it will be denoted by ;
- 2.
- the graph is the graph with vertex set and edge set ; we call it graph and it will be denoted by .
Let us recall that a -design of order v exists if and only if , (see [8]), and that a -design exists if and only if , (see [9]).
In Section 2, we introduce the definitions of locally balanced and strictly balanced designs. In Section 3, we determine the spectrum of strictly T-balanced -designs in some cases, precisely when and T contains the automorphism class corresponding to the element of degree 3 in . In Section 4, we determine the spectrum of strongly balanced -designs, which is a new result as far as we know, and the spectrum of strictly T-balanced -designs in some cases in which and T contains the automorphism class corresponding to the element of degree 3 in . All the results contained in the theorems of this paper are obviously original and not proved by anyone before today.
2. Locally Balanced and Strictly Balanced Designs
In this section, we introduce the following new definitions:
Definition 1.
Let be a G-design and let , . Σ is called:
- locally -balanced if there exists a constant such that , for every ;
- locally T-balanced if Σ is locally -balanced for any ;
- strictly T-balanced if Σ is locally -balanced for any and if Σ is not locally -balanced for any .
Note that, if is an -balanced G-design of order v, for any and , then it must be . This implies that:
Theorem 1.
If is an -balanced G-design of order v and , then for any .
3. Locally Balanced -Designs
Let be the graph . Then, its automorphism classes are , , and . We will focus our attention on the class , which we call the central class.
First, we need a few preliminary results.
Proposition 1.
Let X and Y be two disjoint sets, with . Then, there exists a -decomposition of , such that:
- 1.
- , for any , for any
- 2.
- for any and for any .
Proof.
Let and . Then it is sufficient to consider the following blocks:
□
Proposition 2.
There exists a strongly balanced -decomposition of .
Proof.
Let and . Let us consider , , and . Then it is sufficient to apply Proposition 1 to:
- , in such a way that the vertices of occupy the positions of and and the vertices of occupy the positions of and ;
- , in such a way that the vertices of occupy the positions of and and the vertices of occupy the positions of and ;
- , in such a way that the vertices of occupy the positions of and and the vertices of occupy the positions of and ;
- , in such a way that the vertices of occupy the positions of and and the vertices of occupy the positions of and .
By taking all the blocks of these decompositions we obtain a strongly balanced -decomposition of . □
Now, we determine the spectrum of the strictly T-balanced -designs, where T is a proper subset of and contains the central class . It is not difficult to see that , otherwise we have a contradiction, because the design would be strongly balanced.
Theorem 2.
There exists a strictly -balanced -design if and only if , .
Proof.
By Theorem 1 we obtain the necessary condition.
Let . In such a case, we see that a strictly -balanced design is , where and is the set of the following blocks:
Let , for some . Let , for be pairwise disjoint sets, such that for any i and let . Let . Let us consider the following systems:
- for any a strictly -balanced -design of order 11;
- for any , , a strongly balanced -decomposition of (by Proposition 2).
Then, it is easy to see that is a strictly -balanced -design of order . □
Theorem 3.
There exists a strictly -balanced -design of order v if and only if , .
Proof.
The necessary condition is clear by Theorem 1. It is also easy to see that a -design of order 11 which is -balanced must be also -balanced. So, it must be .
Now, let and let . Consider the system , having blocks:
- for ;
- for .
The system is cyclic and strongly balanced. Replace the blocks , and with:
Then, the system that we obtain is not strongly balanced, but strictly -balanced.
Let , for some . Let pairwise disjoint sets, with , let and . Let us consider:
- a -design of order 21 which is strictly -balanced;
- a strongly balanced -design for ;
- a strongly balanced -decomposition of for , , and for and , by Proposition 2.
Let be the set of all these blocks and let . Then is a -design which is strictly -balanced. □
Theorem 4.
There exists a strictly -balanced -design of order v if and only if , .
Proof.
The necessary condition is clear by Theorem 1. As in the previous result, it must be . For , take the strongly balanced system considered in Theorem 3 and replace the blocks and with the blocks:
Then, the system that we obtain is strictly -balanced.
Now, for it is sufficient to repeat the construction of Theorem 3 in order to obtain the statement. □
Theorem 5.
There exists a strictly -balanced -design of order v if and only if , .
Proof.
The necessary condition is clear by Theorem 1. As before, it must be , because for , a locally -balanced -design is also locally -balanced. For , take the strongly balanced system , considered in Theorem 3, and replace the blocks and with:
In this way, we obtain a strictly -balanced -design of order 21. If we also replace the blocks and , as in Theorem 3, we obtain a strictly -balanced design of order 21.
Now, for , it is sufficient to repeat the construction of Theorem 3 in order to obtain the statement. □
4. Locally Balanced -Designs
Let be the graph . Then, its automorphism classes are , , , and . First, let us determine the spectrum of strongly balanced -designs.
Theorem 6.
There exists a strongly balanced -design if and only if , .
Proof.
Let be any -design of order v, which is locally -balanced. If for every , then necessarily:
from which and , .
Now, let , for some , . Let be the cyclic system on having as blocks:
for and . Then is clearly strongly balanced. □
The determination of the spectrum for a few strictly T-balanced -designs, with T containing the central class , consisting of the only vertex in having degree three, is given as follows.
Theorem 7.
There exists a strongly balanced -decomposition of .
Proof.
First, let us consider two disjoint sets and . Then, the system , having blocks:
for is a -decomposition of , such that:
- the vertices of , and are occupied by , each appearing exactly one time;
- the vertices of are occupied by , each appearing exactly one time;
- the vertices of are occupied by , each appearing exactly twice.
Now, let and , where and for are all pairwise disjoint sets, such that . Let be an oriented complete bipartite graph with partite sets and and an Eulerian orientation, which means that for any .
If (resp. ) for some , then consider a -decomposition of such that:
- the vertices of , and are occupied by (resp. ), each appearing exactly one time;
- the vertices of are occupied by (resp. ), each appearing exactly one time;
- the vertices of are occupied by (resp. ), each appearing exactly twice.
Let be the system on having all these as blocks. Then it is easy to see that satisfies the conditions of the statement. □
Theorem 8.
There exists a strictly -balanced -design of order 13.
Proof.
Let and let be the family of blocks , defined as follows:
It is possible to verify that is a -design of order 13, defined in X. Further, we can control that:
for every , and that:
Further, it is:
Therefore, is a strictly -balanced system. □
Theorem 9.
There exists a strictly -balanced -design if and only if , .
Proof.
As before, if a system of order v is locally -balanced, then , .
Construction. . Let , be two -designs, both strictly -balanced, of order, respectively, , and , such that . Observe that the vertices of all have degrees h in , h in , in and the vertices of all have degrees 1 in , 1 in and 2 in .
Let . It is . Let be a partition on in h classes , all of cardinality 12.
For every , consider a strongly balanced system by Theorem 7. Let . If , we can say that is a strictly -balanced -design of order .
Indeed, in every family , , all the vertices of occupy the positions of , and the same number of times, i.e.:
for every , in . This means that:
and therefore is a strictly -balanced system. □
Theorem 10.
There exists a strictly -balanced -design if and only if , .
Proof.
Let be a strictly -balanced -design of order v. As in Theorem 9, we see that . Suppose, now, that . In this case, we have:
This implies that:
Clearly, this means that for any and, since , we obtain for any , so that is strongly balanced.
Now, let . We want to construct a locally -balanced -design which is not locally and -balanced. So, consider the cyclic system , having blocks:
and
for . Then consider the blocks , , , and and replace them with the blocks:
Then, we obtain a system of order 25 which is strictly -balanced.
Now, let , for some . Let ,..., be pairwise disjoint sets, such that for any and let . Let . Let us consider a -design of order 25 satisfying the conditions of the statement for any . Moreover, for any , , consider a system satisfying the conditions of Theorem 7. Then, clearly is a -design of order which is strictly -balanced.
Let , for some , . Let ,...,, Y be pairwise disjoint sets, such that for any and and let . Let us consider , a -design of order v which is strictly -balanced. Consider also a -design of order 13 which is strongly balanced by Theorem 6. At last, by Theorem 7 we can consider a -decomposition of , such that:
- the vertices of , , and are occupied by each vertex in Y times and by each vertex in , for any , exactly 1 time;
- the vertices of are occupied by each vertex in Y exactly times and by each vertex in , for any , exactly 2 times.
Let . Then clearly is a -design of order v satisfying the conditions of the statement. □
Theorem 11.
There exists a strictly -balanced -design if and only if , .
Proof.
As before, if a system of order v is locally -balanced, then , .
Now, let , for some , . Let be the cyclic system on having as blocks:
for and . Then consider the blocks and and replace them with the blocks:
and
Then, it is easy to see that the system that we obtain with such a substitution is locally -balanced, but not locally and -balanced. □
5. Conclusions
In this paper, the notions of locally balanced G-design and strictly T-balanced G-design have been introduced, with T being a set of automorphism classes of G, following the already well-known concepts of balanced and strongly balanced graph designs. We analyze this problem in the cases that and , determining the spectrum of strictly T-balanced G-design for some T.
Author Contributions
P.B., M.G. and L.M. contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding
Research supported by GNSAGA-INDAM and by PIA.CE.RI. project of the University of Catania.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Berardi, L.; Gionfriddo, M.; Rota, R. Balanced and strongly balanced Pk-designs. Discrete Math. 2012, 312, 633–636. [Google Scholar] [CrossRef]
- Gionfriddo, M.; Küçükçifçi, S.; Milazzo, L. Balanced and strongly balanced 4-kite designs. Util. Math. 2013, 91, 121–129. [Google Scholar]
- Bonvicini, S. Degree- and orbit-balanced Γ-designs when Γ has five vertices. J. Combin. Des. 2013, 21, 359–389. [Google Scholar] [CrossRef]
- Bonisoli, A.; Ruini, B. Tree-designs with balanced-type conditions. Discrete Math. 2013, 313, 1197–1205. [Google Scholar] [CrossRef]
- Bonacini, P.; Gionfriddo, M.; Marino, L. Balanced House-systems and Nestings. Ars Combin. 2015, 121, 429–436. [Google Scholar]
- Bonacini, P.; Giovanni, M.D.; Gionfriddo, M.; Marino, L.; Tripodi, A. The spectrum of balanced P(3)(1,5)-designs. Contrib. Discrete Math. 2017, 12, 133–142. [Google Scholar]
- Bonacini, P.; Gionfriddo, M.; Marino, L. Edge balanced 3-uniform hypergraph designs. Mathematics 2020, 8, 1353. [Google Scholar] [CrossRef]
- Bermond, J.C.; Huang, C.; Rosa, A.; Sotteau, D. Decompositions of complete graphs into isomorphic subgraphs with five vertices. Ars Combin. 1980, 10, 211–254. [Google Scholar]
- Yin, J.X.; Gong, B.S. Existence of G-designs with |V(G)|=6. In Combinatorial Designs and Applications (Huangshan, 1998), Lecture Notes in Pure and Applied Mathematics; Dekker: New York, NY, USA, 1990; Volume 126, pp. 201–218. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).