منابع مشابه
About Balanced G-Designs
Abstract A G-design is said to be balanced if the degree of its vertices is constant. We say that a G-design is strongly balanced, if for every i = 1, 2, ..., h, there exists a constant Ci such that dAi(x) = Ci, for every vertex x, where Ai indicates an automorphism classes (orbits) of the automorphism group of G, on its vertex-set, and dAi(x) is the number of blocks containing x as an element ...
متن کاملDefining sets of G-designs
Several results, analogous to those already obtained for defining sets of t-( v, k,'x) designs, are presented in the case of G-designs. Computational methods and trade structures are used to construct minimal defining sets of each possible size for each of the eight non-isomorphic 4-cycle systems of order 9, and for each of the two non-isomorphic 2-perfect 5cycle systems of order 11. A recursiv...
متن کاملMixed partitions and related designs
We define a mixed partition of Π = PG(d, qr) to be a partition of the points of Π into subspaces of two distinct types, for instance, a partition of PG(2n− 1, q2) into (n− 1)-spaces and Baer subspaces of dimension 2n− 1. In this paper we provide a group theoretic method for constructing a robust class of such partitions. It is known that a mixed partition of PG(2n−1, q2) can be used to construc...
متن کاملTheta Graph Designs
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
متن کاملG-designs without blocking sets, Note
For an undirected graph G and a natural number n, a G-design of order n is an edge partition of the complete graph Kn with n vertices into subgraphs G1, G2, . . . , each isomorphic to G. A set T ⊂ V (Kn) is called a blocking set if it meets the vertex set V (Gi) of each Gi in the decomposition, but contains none of them. In a previous paper [J. Combin. Designs 4 (1996), 135–142] the first and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90408-l