SGDs with doubly transitive automorphism group

Peter J. Cameron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)229-233
Number of pages5
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - 1 Jan 1999


  • 2-transitive group
  • Symmetric graph design


Dive into the research topics of 'SGDs with doubly transitive automorphism group'. Together they form a unique fingerprint.

Cite this