Finite edge-transitive dihedrant graphs
2012
In this paper, we first prove that each biquasiprimitive permutation group containing a regular dihedral subgroup is biprimitive, and then give a classification of such groups. The classification is then used to classify vertex-quasiprimitive and vertex-biquasiprimitive edge-transitive dihedrants. Moreover, a characterization of valencies of normal edge-transitive dihedrants is obtained, and some classes of examples with certain valences are constructed.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
23
References
3
Citations
NaN
KQI