On 2-arc transitive graphs of girth 4

Peter J. Cameron; Cheryl E. Praeger

doi:10.1016/0095-8956(83)90075-8

On 2-arc transitive graphs of girth 4

Peter J. Cameron^*, Cheryl E. Praeger

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	1-11
Number of pages	11
Journal	Journal of Combinatorial Theory, Series B
Volume	35
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(83)90075-8
Publication status	Published - 1 Jan 1983

Access to Document

10.1016/0095-8956(83)90075-8

Cite this

@article{f928e15804044a2794f81d4567e52093,

title = "On 2-arc transitive graphs of girth 4",

abstract = "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.",

author = "Cameron, {Peter J.} and Praeger, {Cheryl E.}",

year = "1983",

month = jan,

day = "1",

doi = "10.1016/0095-8956(83)90075-8",

language = "English",

volume = "35",

pages = "1--11",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press/Elsevier ",

number = "1",

}

TY - JOUR

T1 - On 2-arc transitive graphs of girth 4

AU - Cameron, Peter J.

AU - Praeger, Cheryl E.

PY - 1983/1/1

Y1 - 1983/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35949002717&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(83)90075-8

DO - 10.1016/0095-8956(83)90075-8

M3 - Article

AN - SCOPUS:35949002717

SN - 0095-8956

VL - 35

SP - 1

EP - 11

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 1

ER -

On 2-arc transitive graphs of girth 4

Abstract

Access to Document

Other files and links

Fingerprint

Cite this