TY - JOUR
T1 - SGDs with doubly transitive automorphism group
AU - Cameron, Peter J.
PY - 1999/1/1
Y1 - 1999/1/1
N2 - Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmetric BIBDs and orthogonal double covers. This note gives a classification of SGDs admitting a 2-transitive automorphism group. There are too many for a complete determination, but in some special cases the determination can be completed, such as those that admit a 3-transitive group, and those with λ = 1. The latter case includes the determination of all near 1-factorizations of Kn (partitions of the edge set into subsets each of which consists of disjoint edges covering all but one point), which admit 2-transitive groups.
AB - Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmetric BIBDs and orthogonal double covers. This note gives a classification of SGDs admitting a 2-transitive automorphism group. There are too many for a complete determination, but in some special cases the determination can be completed, such as those that admit a 3-transitive group, and those with λ = 1. The latter case includes the determination of all near 1-factorizations of Kn (partitions of the edge set into subsets each of which consists of disjoint edges covering all but one point), which admit 2-transitive groups.
KW - 2-transitive group
KW - Symmetric graph design
UR - http://www.scopus.com/inward/record.url?scp=0033449579&partnerID=8YFLogxK
U2 - 10.1002/(SICI)1097-0118(199911)32:3<229::AID-JGT2>3.0.CO;2-C
DO - 10.1002/(SICI)1097-0118(199911)32:3<229::AID-JGT2>3.0.CO;2-C
M3 - Article
AN - SCOPUS:0033449579
SN - 0364-9024
VL - 32
SP - 229
EP - 233
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 3
ER -