On Finite s-Transitive Graphs of Odd Order

Cai-Heng Li

doi:10.1006/jctb.2000.2012

On Finite s-Transitive Graphs of Odd Order

Cai-Heng Li

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

35 Citations (Web of Science)

Abstract

It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only of s less than or equal to3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive. (C) 2001 Academic Press.

Original language	English
Pages (from-to)	307-317
Journal	Journal of combinatorial Theory Series B
Volume	81
DOIs	https://doi.org/10.1006/jctb.2000.2012
Publication status	Published - 2001

Access to Document

10.1006/jctb.2000.2012

Cite this

@article{3cdb7a6bc58745e39bf040c6946604af,

title = "On Finite s-Transitive Graphs of Odd Order",

abstract = "It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only of s less than or equal to3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive. (C) 2001 Academic Press.",

author = "Cai-Heng Li",

year = "2001",

doi = "10.1006/jctb.2000.2012",

language = "English",

volume = "81",

pages = "307--317",

journal = "Journal of combinatorial Theory Series B",

issn = "0095-8956",

publisher = "Academic Press",

}

TY - JOUR

T1 - On Finite s-Transitive Graphs of Odd Order

AU - Li, Cai-Heng

PY - 2001

Y1 - 2001

N2 - It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only of s less than or equal to3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive. (C) 2001 Academic Press.

AB - It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only of s less than or equal to3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive. (C) 2001 Academic Press.

U2 - 10.1006/jctb.2000.2012

DO - 10.1006/jctb.2000.2012

M3 - Article

SN - 0095-8956

VL - 81

SP - 307

EP - 317

JO - Journal of combinatorial Theory Series B

JF - Journal of combinatorial Theory Series B

ER -

On Finite s-Transitive Graphs of Odd Order

Abstract

Access to Document

Fingerprint

Cite this