General Constructions for Double Group Divisible Designs and Double Frames

We generalize the concept of an incomplete double group divisible design and describe some recursive constructions for such a generalized new design. As a consequence, we obtain a general recursive construction for group divisible designs, which unifies many important recursive constructions for various types of combinatorial designs. We also introduce the concept of a double frame. After providing a preliminary result on the number of partial resolution classes, we describe a general construction for double frames. This construction method can unify many known recursive constructions for frames.     

Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5

An orthogonal double cover (ODC) of the complete graph K_n by a graph G is a collection = {G_i|i = 1,2, . . . ,n} of spanning subgraphs of K_n, all isomorphic to G, with the property that every edge of K_n belongs to exactly two members of and any two distinct members of share exactly one edge. A caterpillar of diameter five is a tree arising from a path with six vertices by attaching pendant vertices to some or each of its vertices of degree two. We show that for any caterpillar of diameter five there exists an ODC of the complete graph K_n.     

On Orthogonal Double Covers of Graphs

A transformation which allows us to obtain an orthogonal double cover of a graph G from any permutation of the edge set of G is described. This transformation is used together with existence results for self-orthogonal latin squares, to give a simple proof of a conjecture of Chung and West.     

近三角剖分图的均衡二重少圈覆盖

近三角剖分图是一连通平面图，其内面均为三角形而其外面可能不是．令Ｇ为一具有ｎ个节点的近三角剖分图，Ｃ为 Ｇ的一个小圈二重覆盖（ＳＣＤＣ）^［２］．令(?)则Ｃ₀。称为Ｇ的均衡小圈二重覆盖．本文将证明：若Ｇ为外平面图，则 δ（Ｃ₀）≤ ２；否则δ（Ｃ₀）≤４。     

少圈二重覆盖平面近三角剖分图的生成元

令Ｇ为一具有ｎ个节点的平面近三角剖分图,Ｃ为Ｇ的一个少圈二重覆盖（ＳＣＤＣ）．本文首先给出了Ｇ的一些生成元,由此可以得到Ｇ的一个ＳＣＤＣ．若Ｇ为一外平面近三角剖分图,得到 ｜Ｃ｜≤ｎ－２的一充分必要条件;若 Ｇ至少有一个内点,得到｜Ｃ｜≤ｎ－２的一充分条件．     

A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths

K _n by a graph G is a collection ? of n spanning subgraphs of K _n , all isomorphic to G, such that any two members of ? share exactly one edge and every edge of K _n is contained in exactly two members of ?. In the 1980's Hering posed the problem to decide the existence of an ODC for the case that G is an almost-hamiltonian cycle, i.e. a cycle of length n−1. It is known that the existence of an ODC of K _n by a hamiltonian path implies the existence of ODCs of K _4n and K _16n , respectively, by almost-hamiltonian cycles. Horton and Nonay introduced 2-colorable ODCs and showed: If for n≥3 and a prime power q≥5 there are an ODC of K _n by a hamiltonian path and a 2-colorable ODC of K _q by a hamiltonian path, then there is an ODC of K _qn by a hamiltonian path. We construct 2-colorable ODCs of K _n and K _2n , respectively, by hamiltonian paths for all odd square numbers n≥9. Received: January 27, 2000     

Double Covers of Some Fano Manifolds as Hyperplane Sections

Let Y be a Fano manifold of dimension n ? 3 with b₂(Y and index n – 1 and let A be a projective manifold which is a double cover of Y. We determine which complex projective manifolds can admit A among their hyperplane sections.     

Distance-Regular Graphs with c i = b d-i and Antipodal Double Covers

Let be a distance-regular graph of diameter d and valency k > 2. Suppose there exists an integer s with d 2s such that c _i = b _d-i for all 1 i s. Then is an antipodal double cover.     

On Orthogonal Double Covers of Graphs

An orthogonal double cover (ODC) is a collection of n spanning subgraphs(pages) of the complete graph K _n such that they cover every edge of the completegraph twice and the intersection of any two of them contains exactly one edge. If all the pages are isomorphic tosome graph G, we speak of an ODC by G. ODCs have been studied for almost 25 years, and existenceresults have been derived for many graph classes. We present an overview of the current state of research alongwith some new results and generalizations. As will be obvious, progress made in the last 10 years is in many waysrelated to the work of Ron Mullin. So it is natural and with pleasure that we dedicate this article to Ron, on theoccasion of his 65th birthday.     

Super-simple group divisible designs with block size 4 and index 5

In this paper, we investigate the existence of a super-simple (4, 5)-GDD of type g^u and show that such a design exists if and only if u≥4, g(u−2)≥10, and .     

Constructions of Group Divisible Designs

In this paper we present constructions for group divisible designs from generalized partial difference matrices. We describe some classes of examples.     

On constructions for two dimensional balanced sampling plan excluding contiguous units with block size four

Balanced sampling plans excluding contiguous units (BSEC) were first introduced in 1988 by Hedayat, Rao and Stufken [A.S. Hedayat, C.R. Rao, J. Stufken, Sampling plans excluding contiguous units, J. Statist. Plann. Inference 19 (1988) 159-170]. These designs can be used for survey sampling when the contiguous units provide similar information. In this paper, we show some recursive constructions for two dimensional BSECs with block size four, and give the existence of some infinite classes.     

Embeddings of resolvable group divisible designs with block size 3

It is proved in this paper that an RGD(3, g;v) can be embedded in an RGD(3, g;u) if and only if , , , v ≥ 3g, u ≥ 3v, and (g,v) ≠ (2,6),(2,12),(6,18).     

The spectrum of semicyclic holey group divisible designs with block size three

We determine a necessary and sufficient condition for the existence of semicyclic holey group divisible designs with block size three and group type $\left(n,m^t\right)$. New recursive constructions on semicyclic incomplete holey group divisible designs are introduced to settle this problem completely.     

Group divisible designs with block size four and type —II

We show that the necessary conditions for the existence of group divisible designs with block size four (4‐GDDs) of type are sufficient for (mod ), = 39, 51, 57, 69, 87, 93, 111, 123 and 129, and for = 13, 17, 19, 23, 25, 29, 31 and 35. More generally, we show that for (mod 6), the possible exceptions occur only when , and there are no exceptions at all if has a divisor such that (mod 4) or is a prime not greater than 43. Hence, there are no exceptions when (mod 12). Consequently, we are able to extend the known spectrum for and 5 (mod 6). Also, we complete the spectrum for 4‐GDDs of type .     

关于L内射覆盖

We use the class of L-injective modules to define L-injective covers, and provide the characterizations of L-injective covers by the properties of kernels of homomorphisms. We prove that the right L-noetherian right L-hereditary ring is just such that every right R-module has an L-injective cover which is monic. We also use kernels of homomorphisms to investigate L-simple L-injective covers and give some constructions of L-simple L-injective covers.     

Existence of generalized Bhaskar Rao designs with block size 3

There are well-known necessary conditions for the existence of a generalized Bhaskar Rao design over a group G, with block size k=3. The recently proved Hall-Paige conjecture shows that these are sufficient when v=3 and λ=|G|. We prove these conditions are sufficient in general when v=3, and also when |G| is small, or when G is dicyclic. We summarize known results supporting the conjecture that these necessary conditions are always sufficient when k=3.     

Group divisible designs with block size 4 where the group sizes are congruent to 2 mod 3

In this paper, we construct a number of 4-GDDs where the group sizes are all congruent to 2 (mod 3). We also show that 4-GDDs of type $2^t{8}^s$ exist for all but a finite number of feasible values of s and t. The largest unknown case has type $2^4{8}^{18}$ and has 152 points. A number of 4-GDDs with at most 50 points are also constructed. These include one of type $4^8{1}^1{10}^1$, the last feasible type of the form $4^s{1}^t{n}^1$ with at most 50 points for which no 4-GDD was known.     

Group divisible designs with block size four and type gum1—III

We deal with group divisible designs (GDDs) that have block size four and group type $g^u{m}^1$, where $g\equiv 2$ or 4 (mod 6). We show that the necessary conditions for the existence of a 4‐GDD of type $g^u{m}^1$ are sufficient when $g$ = 14, 20, 22, 26, 28, 32, 34, 38, 40, 44, 46, 50, 52, 58, 62, 68, 76, 88, 92, 100, 104, 116, 124, 136, 152, 160, 176, 184, 200, 208, 224, 232, 248, 272, 304, 320, 368, 400, 448, 464 and 496. Using these results we go on to show that the necessary conditions are sufficient for $g=2^t{q}^s$, $q$ = 19, 23, 25, 29, 31, $s$, $t=1,2,\dots$, as well as for $g=2^{t}q$, $q$ = 2, 5, 7, 11, 13, 17, $t=1,2,\dots$, with possible exceptions $56^9{m}^1$, $80^9{m}^1$ and $112^9{m}^1$ for a few large values of $m$.