Abstract
We enumerate by computer algorithms all simple t (t +7, t +1, 2) designs for 1 <= t <= 5, i.e. for all possible t , and this enumeration is new for t >= 3. The number of nonisomorphic designs is equal to 3, 13, 27, 1 and 1 for t = 1, 2, 3, 4 and 5, respectively. We also present some properties of these designs including orders of their full automorphism groups and resolvability.
Publication Date
1992
Document Type
Article
Department, Program, or Center
Computer Science (GCCIS)
Recommended Citation
Radziszowski, Stanislaw, "Enumeration of all simple t-(t+7,t+1,2) designs" (1992). The Charles Babbage Research Centre: The Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 12 (), pps. 175-178. Accessed from
https://repository.rit.edu/article/347
Campus
RIT – Main Campus
COinS
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.