Skip to main content
SpringerLink
Log in

Distance — transitive graphs and the problem of maximal subgroups of symmetric groups

  • Conference paper
  • First Online:
Applied Algebra, Algorithmics and Error-Correcting Codes (AAECC 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 228))

  • 146 Accesses

Abstract

We give a necessary and sufficient condition for the automorphism group of a distance-transitive graph to be a maximal unitransitive subgroup of the symmetric group (theorem 1). Then we use the necessary condition of theorem 1 to determine the automorphism groups of a class of graphs (theorem 2). After that, we use the sufficient condition of theorem 1 to determine a class of maximal unitransitive subgroups of the symmetric group Smd.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Referneces

  1. -A. ASTIE-VIDAL Sur certains groupes d'automorphismes de graphes et d'hypergraphes. Thèse Université de Toulouse (Juin 1976).

    Google Scholar 

  2. -A. ASTIE-VIDAL Groupes d'automorphismes des graphes d'intersection aux bases d'un matroïde. Coll. Math. discretes: codes et hypergraphes. Bruxelles 1978. Cahiers C.E.R.O. 20.3-4 — 1978

    Google Scholar 

  3. -A. ASTIE-VIDAL Factor groups of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid. Discrete maths 32 (1980) — 217–224.

    Google Scholar 

  4. -A. ASTIE-VIDAL The automorphism group of a matroid. Annals of discrete maths 9 (1980) — 205–216.

    Google Scholar 

  5. -P. BONNEAUD Thèse — Paris (1984).

    Google Scholar 

  6. -J. CHIFFLET Schémas d'association et groupes d'automorphismes de graphes et hypergraphes. Thèse de 3e cycle — Toulouse (mars 1984)

    Google Scholar 

  7. -H. ENOMOTO Characterization of families of finite permutation groups by the subdegrees I. J. Fac. Sciences University of Tokio, Ia. Vol. 19 No 1, (129–135) — (1972).

    Google Scholar 

  8. -H. ENOMOTO Characterization of families of finite permutation groups by the subdegrees II. J. Fac. Sciences, University of Tokio, Ia, Vol. 19 No 1 (1–11) — (1973).

    Google Scholar 

  9. E. HALBERSTADT On certain maximal subgroups of symmetric or alternating groups, Math. Z, 151 — 117–125 (1976).

    Google Scholar 

  10. L.A. KALOUJNINE, N.H. KLIN On certain maximal subgroups of symmetric or alternating groups. Math. U.S.S.R. Sbornik, vol. 16, N 1 (1972).

    Google Scholar 

  11. J. SKALBA On the maximality of Sn in \(S_{(\begin{array}{*{20}c}n \\k \\\end{array} )}\). J. of algebra 75, 158–174. (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire MLAD, Université Paul Sabatier, Toulouse

    A. Astie-Vidal & J. Chifflet

Authors
  1. A. Astie-Vidal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Chifflet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Astie-Vidal, A., Chifflet, J. (1986). Distance — transitive graphs and the problem of maximal subgroups of symmetric groups. In: Poli, A. (eds) Applied Algebra, Algorithmics and Error-Correcting Codes. AAECC 1984. Lecture Notes in Computer Science, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16767-6_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-16767-6_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16767-9

  • Online ISBN: 978-3-540-38813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation