On 2-arc transitive graphs of girth 4

Peter J. Cameron*, Cheryl E. Praeger

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


It is shown that a 2-arc-transitive graph must be the incidence graph of a (known) symmetric design if (i) the stabilizer of some vertex acts faithfully on the set of neighbours of that vertex as a known doubly transitive group with no abelian normal subgroup and (ii) some pair of vertices at distance 2 is joined by more than six paths of length 2.

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalJournal of Combinatorial Theory, Series B
Issue number1
Publication statusPublished - 1 Jan 1983


Dive into the research topics of 'On 2-arc transitive graphs of girth 4'. Together they form a unique fingerprint.

Cite this