Primitive Permutation Groups with a Common Suborbit, and Edge‐Transitive Graphs | Zendy

Liebeck Martin W. | Zendy; Praeger Cheryl E. | Zendy; Saxl Jan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Primitive Permutation Groups with a Common Suborbit, and Edge‐Transitive Graphs

Author(s) -

Liebeck Martin W.,

Praeger Cheryl E.,

Saxl Jan

Publication year - 2002

Publication title -

proceedings of the london mathematical society

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.899

H-Index - 65

eISSN - 1460-244X

pISSN - 0024-6115

DOI - 10.1112/plms/84.2.405

Subject(s) - mathematics , transitive relation , combinatorics , enhanced data rates for gsm evolution , permutation group , cyclic permutation , permutation (music) , permutation graph , discrete mathematics , graph , symmetric group , artificial intelligence , computer science , physics , acoustics

Dedicated to the memory of Helmut Wielandt In this paper a classification is obtained of all pairs G , H of finite primitive permutation groups such that G < H , the socles of G and H are different, and G and H share a common non‐trivial orbital. An application is given to the study of automorphism groups of edge‐transitive graphs. 2000 Mathematical Subject Classification: 20B15, 20B25.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research