On edge-transitive graphs of square-free order
The electronic journal of combinatorics, Tome 22 (2015) no. 3
We study the class of edge-transitive graphs of square-free order and valency at most $k$. It is shown that, except for a few special families of graphs, only finitely many members in this class are basic (namely, not a normal multicover of another member). Using this result, we determine the automorphism groups of locally primitive arc-transitive graphs with square-free order.
DOI :
10.37236/4573
Classification :
05C25, 20B25
Mots-clés : edge-transitive graph, arc-transitive graph, stabilizer, quasiprimitive permutation group, almost simple group
Mots-clés : edge-transitive graph, arc-transitive graph, stabilizer, quasiprimitive permutation group, almost simple group
@article{10_37236_4573,
author = {Cai Heng Li and Zai Ping Lu and Gai Xia Wang},
title = {On edge-transitive graphs of square-free order},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {3},
doi = {10.37236/4573},
zbl = {1327.05146},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4573/}
}
Cai Heng Li; Zai Ping Lu; Gai Xia Wang. On edge-transitive graphs of square-free order. The electronic journal of combinatorics, Tome 22 (2015) no. 3. doi: 10.37236/4573
Cité par Sources :