论文信息 - Super-simple (v, 5, 2)-designs - 字舞流文

Super-simple (v, 5, 2)-designs

In this paper we study the spectrum of super-simple (ν, 5, 2)-designs. We show that a super-simple (ν, 5, 2)-design exists if and only if ν≡1 or 5 (mod 10), ν ≠ 5, 15, except possibly when ν∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}.

Donald L. Kreher | Alan C. H. Ling | Hans-Dietrich O. F. Gronau | A. Ling | H. Gronau

[1] Sven Hartmann,et al. Suborthogonal double covers of complete graphs , 1998 .

[2] Charles J. Colbourn,et al. The existence of uniform 5‐GDDs , 1997 .

[3] Malcolm Greig. Designs from projective planes and PBD bases , 1999 .

[4] Sven Hartmann,et al. On Orthogonal Double Covers of Graphs , 2002, Des. Codes Cryptogr..

[5] Sven Hartmann,et al. Asymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs , 1999, Discret. Appl. Math..

[6] Sven Hartmann. On simple and supersimple transversal designs , 2000 .

[7] Abdollah Khodkar,et al. Various super-simple designs with block size four , 1994, Australas. J Comb..

[8] R. Julian R. Abel,et al. Some new RBIBDs with block size 5 and PBDs with block sizes ≡1 mod 5 , 1997, Australas. J Comb..

[9] C. Colbourn,et al. CRC Handbook of Combinatorial Designs , 1996 .

[10] Peter Adams,et al. On the existence of super-simple designs with block size 4 , 1995 .

[11] Hanfried Lenz,et al. Design theory , 1985 .

[12] Chi H. A. Ling. Pairwise balanced designs and related codes , 1997 .

[13] Darryn E. Bryant,et al. On Orthogonal Double Covers of Graphs , 1998, Des. Codes Cryptogr..

[14] Sven Hartmann,et al. Superpure digraph designs , 2002 .

[15] Chen Kejun. On the existence of super-simple (v,4,4)-BIBDs , 1996 .

[16] A. Rosa,et al. 2-( v , k , λ) Designs of Small Order , 2006 .