Edge-primitive Cayley graphs on abelian groups and dihedral groups
From MaRDI portal
Publication:1800411
DOI10.1016/j.disc.2018.08.023zbMath1397.05078OpenAlexW2889968475WikidataQ129224802 ScholiaQ129224802MaRDI QIDQ1800411
Jiangmin Pan, Cixuan Wu, Fugang Yin
Publication date: 23 October 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.08.023
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear algebraic groups over finite fields (20G40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
Edge-primitive graphs of prime power order, On edge-primitive 3-arc-transitive graphs, Resistance distance and Kirchhoff index in dihedral Cayley graphs, On edge-primitive graphs of order twice a prime power
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The finite edge-primitive pentavalent graphs
- Kantenprimitive Graphen vom Grad drei
- Finite edge-transitive dihedrant graphs
- On finite edge-primitive and edge-quasiprimitive graphs
- On weakly symmetric graphs of order twice a prime
- On 2-arc-transitivity of Cayley graphs
- Finite edge-primitive graphs of prime valency
- Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5
- Edge-primitive tetravalent graphs
- Locally primitive Cayley graphs of dihedral groups
- Finite 2-arc-transitive abelian Cayley graphs
- The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
- The finite primitive groups with soluble stabilizers, and the edge-primitive s -arc transitive graphs
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- The Inclusion Problem for Finite Primitive Permutation Groups
- Finite Permutation Groups and Finite Simple Groups
- The Finite Primitive Permutation Groups Containing an Abelian Regular Subgroup
- Finite edge-transitive Cayley graphs and rotary Cayley maps
- ARC TRANSITIVITY IN GRAPHS