Digraphs Admitting Sharply Edge-transitive Automorphism Groups

Peter J. Cameron

doi:10.1016/S0195-6698(87)80043-4

Digraphs Admitting Sharply Edge-transitive Automorphism Groups

Peter J. Cameron^*

^*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981. This paper improves several of their results. Complete multipartite graphs are especially interesting; I give new constructions and nonexistence theorems for these. I also give new results on the maximum valency of arbitrary digraphs with this property.

Original language	English
Pages (from-to)	357-365
Number of pages	9
Journal	European Journal of Combinatorics
Volume	8
Issue number	4
DOIs	https://doi.org/10.1016/S0195-6698(87)80043-4
Publication status	Published - 1 Jan 1987

Access to Document

10.1016/S0195-6698(87)80043-4

Cite this

@article{9dc6dbbad9df483d99f5b8d0522a516f,

title = "Digraphs Admitting Sharply Edge-transitive Automorphism Groups",

abstract = "Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981. This paper improves several of their results. Complete multipartite graphs are especially interesting; I give new constructions and nonexistence theorems for these. I also give new results on the maximum valency of arbitrary digraphs with this property.",

author = "Cameron, {Peter J.}",

year = "1987",

month = jan,

day = "1",

doi = "10.1016/S0195-6698(87)80043-4",

language = "English",

volume = "8",

pages = "357--365",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press/Elsevier ",

number = "4",

}

TY - JOUR

T1 - Digraphs Admitting Sharply Edge-transitive Automorphism Groups

AU - Cameron, Peter J.

PY - 1987/1/1

Y1 - 1987/1/1

N2 - Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981. This paper improves several of their results. Complete multipartite graphs are especially interesting; I give new constructions and nonexistence theorems for these. I also give new results on the maximum valency of arbitrary digraphs with this property.

AB - Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981. This paper improves several of their results. Complete multipartite graphs are especially interesting; I give new constructions and nonexistence theorems for these. I also give new results on the maximum valency of arbitrary digraphs with this property.

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

U2 - 10.1016/S0195-6698(87)80043-4

DO - 10.1016/S0195-6698(87)80043-4

M3 - Article

AN - SCOPUS:17444371637

SN - 0195-6698

VL - 8

SP - 357

EP - 365

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 4

ER -

Digraphs Admitting Sharply Edge-transitive Automorphism Groups

Abstract

Access to Document

Other files and links

Fingerprint

Cite this