Skip to main content
SpringerLink
Log in

Finite transitive permutation groups and finite vertex-transitive graphs

  • Chapter
Graph Symmetry

Part of the book series: NATO ASI Series ((ASIC,volume 497))

Abstract

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. The chapter explores the way the two theories have influenced each other. Examples are drawn from the enumeration of vertex-transitive graphs of small order, the classification problem for finite distance transitive graphs, and the investigations of finite 2-arc transitive graphs, finite primitive and quasiprimitive permutation groups, and finite locally primitive graphs. The nature of the group theoretic techniques used range from elementary ones to some involving the finite simple group classification. In particular the theorem of O’Nan and Scott for finite primitive permutation groups, and a generalisation of it for finite quasiprimitive permutation groups is discussed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Adam, Research problem 2–10, J. Combin. Theory 2 (1967), 309.

    Google Scholar 

  2. B. Alspach and T. D. Parsons, Isomorphisms of circulant graphs and digraphs, Discrete Math. 25 (1979), 97–108.

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Aschbacher, On the maximal subgroups of the finite classical groups, Invent. Math. 76 (1984), 469–514.

    Article  MathSciNet  MATH  Google Scholar 

  4. M. Aschbacher and L. L. Scott, Maximal subgroups of finite groups, J. Algebra 92 (1985), 44–80.

    Article  MathSciNet  MATH  Google Scholar 

  5. L. Babai, Isomorphism problem for a class of point-symmetric structures, Acta Math. Acad. Sci. Hungar. 29 (1977), 329–336.

    Article  MathSciNet  MATH  Google Scholar 

  6. L. Babai, Arc transitive covering digraphs and their eigenvalues, J. Graph Theory 9 (1985), 363–370.

    Article  MathSciNet  MATH  Google Scholar 

  7. L. Babai and P. Frankl, Isomorphisms of Cayley graphs I, in: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely 1976), Colloq. Math. Soc. Janos Bolyai 18, North-Holland, Amsterdam, 1978, 35–52.

    Google Scholar 

  8. L. Babai and P. Frankl, Isomorphisms of Cayley graphs II, Acta Math. Acad. Sci. Hungar. 34 (1979), 177–183.

    Article  MathSciNet  MATH  Google Scholar 

  9. R. W. Baddeley, Two-arc transitive graphs and twisted wreath products, J. Alg. Combin. 2 (1993), 215–237.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. W. Baddeley and C. E. Praeger, On classifying all full factorisations and multiple-factorisations of the finite almost simple groups, Technical Report No. 1996/13, University of Leicester, 1996.

    Google Scholar 

  11. R. W. Baddeley and C. E. Praeger, On primitive overgroups of quasiprimitive permutation groups, Technical Report No. 1996/14, University of Leicester, 1996.

    Google Scholar 

  12. R. W. Baddeley and C. E. Praeger, Expansion and blow-up decompositions of quasiprimitive permutation groups, in preparation.

    Google Scholar 

  13. N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, 1993.

    Google Scholar 

  14. J. T. M. van Bon and A. E. Brouwer, The distance-regular antipodal covers of classical distance-regular graphs, in: Combinatorics (Proc. Seventh Hungarian Colloq., Eger 1987), Colloq. Math. Soc. Janos Bolyai 52, North-Holland, Amsterdam, 1988, 141–166.

    Google Scholar 

  15. J. T. M. van Bon and A. M. Cohen, Prospective classification of distance-transitive graphs, in: Combinatorics ‘88, vol.1 ( A. Barlotti et al., eds.), Mediterranean Press, Rende, 1991, 25–38.

    Google Scholar 

  16. J. T. M. van Bon and A. M. Cohen, Linear groups and distance-transitive graphs, European J. Combin. 10 (1989), 399–412.

    MathSciNet  MATH  Google Scholar 

  17. W. Bosma and J. Cannon, Handbook of MAGMA Functions, School of Mathematics and Statistics, Sydney University, 1994.

    Google Scholar 

  18. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs, Springer Verlag, Berlin-Heidelberg-New York, 1989.

    Book  MATH  Google Scholar 

  19. A. E. Brouwer and J. Hemmeter, A new family of distance-regular graphs and the 0,1,21-cliques in dual polar graphs, European J. Combin. 13 (1992), 71–79.

    Article  MathSciNet  MATH  Google Scholar 

  20. P. J. Cameron, Finite permutation groups and finite simple groups, Bull. London Math. Soc. 13 (1981), 1–22.

    Article  MathSciNet  MATH  Google Scholar 

  21. P. J. Cameron, There are only finitely many finite distance-transitive graphs of given valency greater than 2, Combinatorica 2 (1982), 9–13.

    Article  MathSciNet  MATH  Google Scholar 

  22. I. V. Chuvaeva and D. V. Pasechnik, Distance-transitive graphs of type q • Kq q and projective planes, European J. Combin. 11 (1990), 341–346.

    MathSciNet  MATH  Google Scholar 

  23. J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford, 1985.

    MATH  Google Scholar 

  24. B. Elspas and J. Turner, Graphs with circulant adjacency matrices, J. Combin. Theory 9 (1970), 297–307.

    Article  MathSciNet  MATH  Google Scholar 

  25. X. G. Fang, Construction and classification of some families of almost simple 2-arc transitive graphs, PhD Thesis, University of Western Australia, 1995.

    Google Scholar 

  26. X. G. Fang and C. E. Praeger, Finite two-arc transitive graphs admitting a Suzuki simple group, Research Report, Department of Mathematics, University of Western Australia, 1996.

    Google Scholar 

  27. X. G. Fang and C. E. Praeger, Finite two-arc transitive graphs admitting a Ree simple group, Research Report, Department of Mathematics, University of Western Australia, 1996.

    Google Scholar 

  28. X. G. Fang and C. E. Praeger, On graphs admitting arc-transitive actions of almost simple groups, Research Report, Department of Mathematics, University of Western Australia, 1996.

    Google Scholar 

  29. I. A. Faradzev and A. A. Ivanov, Distance-transitive representations of the groups G, PSL2(q) 00000 G 00000 PFL2(q), European J. Combin. 11 (1990), 348–356.

    MathSciNet  Google Scholar 

  30. A. D. Gardiner, Antipodal covering graphs, J. Combin. Theory Ser. B 16 (1974), 255–273.

    Article  MathSciNet  MATH  Google Scholar 

  31. A. D. Gardiner, Imprimitive distance-regular graphs and projective planes, J. Combin. Theory Ser. B 16 (1974), 274–281.

    Article  MathSciNet  MATH  Google Scholar 

  32. A. D. Gardiner and C. E. Praeger, On 4-valent symmetric graphs, European J. Combin. 15 (1994), 375–381.

    Article  MathSciNet  MATH  Google Scholar 

  33. A. D. Gardiner and C. E. Praeger, A geometrical approach to imprimitive symmetric graphs, Proc. London Math. Soc. (3) 71 (1995), 524–546.

    Article  MathSciNet  MATH  Google Scholar 

  34. C. D. Godsil, R. A. Liebler, and C. E. Praeger, Antipodal distance transitive covers of complete graphs, in preparation.

    Google Scholar 

  35. A. Hassani, L. Nochefranca and C. E. Praeger, Finite two-arc transitive graphs admitting a two-dimensional projective linear group, Research Report, Department of Mathematics, University of Western Australia, 1995.

    Google Scholar 

  36. J. Hemmeter, Halved graphs, Hamming and Johnson graphs, Utilitas Math. 25 (1984), 115–118.

    MathSciNet  MATH  Google Scholar 

  37. J. Hemmeter, Distance-regular graphs and halved graphs, European J. Combin. 7 (1986), 119–129.

    MathSciNet  MATH  Google Scholar 

  38. J. Hemmeter, The large cliques in the graph of quadratic forms, European J. Combin. 9 (1988), 395–410.

    MathSciNet  MATH  Google Scholar 

  39. D. Holt, The mechanical computation of first and second cohomology groups, J. Symbolic Comput. 1 (1985), 351–361.

    Article  MathSciNet  MATH  Google Scholar 

  40. N. F. J. Inglis, Multiplicity-free permutation characters, distance-transitive graphs, and classical groups, PhD Thesis, University of Cambridge, 1986.

    Google Scholar 

  41. N. F. J. Inglis, M. W. Liebeck and J. Saxl, Multiplicity-free permutation representations of finite linear groups, Math. Z. 192 (1986), 329–337.

    Article  MathSciNet  MATH  Google Scholar 

  42. I. M. Isaacs, Character Theory of Finite Groups, Academic Press, New York, 1976.

    MATH  Google Scholar 

  43. A. A. Ivanov, Distance-transitive representations of the symmetric groups, J. Combin. Theory Ser. B 41 (1986), 255–274.

    Article  MathSciNet  MATH  Google Scholar 

  44. A. A. Ivanov, Distance-transitive graphs and their classification, in: Investigations in the Algebraic Theory of Combinatorial Objects (I.A.Faradiev et al., eds.), Math. Appl. (Soviet Ser.) 84, Kluwer, Dordrecht, 1994, 283–378.

    Google Scholar 

  45. A. A. Ivanov, R. A. Liebler, T. Penttila, and C. E. Praeger, Antipodal distance-transitive covers of complete bipartite graphs, to appear in European J. Combin.

    Google Scholar 

  46. A. A. Ivanov, S. A. Linton, K. Lux, J. Saxl and L. Soicher, Distance-transitive representations of the sporadic groups, Comm. Algebra 23 (1995), 3379–3427.

    Article  MathSciNet  MATH  Google Scholar 

  47. A. A. Ivanov and C. E. Praeger, On finite affine 2-arc transitive graphs, European J. Combin. 14 (1993), 421–444.

    Article  MathSciNet  MATH  Google Scholar 

  48. A. A. Ivanov and C. E. Praeger, Problem Session at ALCOM-91, European J. Combin. 15 (1994), 105–112.

    Article  MathSciNet  MATH  Google Scholar 

  49. P. M. Kleidman and M. Liebeck, The Subgroup Structure of the Finite Classical Groups, London Math. Soc. Lecture Note Ser. 129, Cambridge University Press, Cambridge, 1990.

    Google Scholar 

  50. L. G. Kovacs, Maximal subgroups in composite finite groups, J. Algebra 99 (1986), 114–131.

    Article  MathSciNet  MATH  Google Scholar 

  51. C. H. Li, Isomorphisms of finite Cayley graphs, PhD Thesis, University of Western Australia, 1996.

    Google Scholar 

  52. C. H. Li, Finite CI-groups are solvable, submitted.

    Google Scholar 

  53. C. H. Li, A family of quasiprimitive 2-arc transitive graphs which have non-quasiprimitive full automorphism groups, preprint 1996.

    Google Scholar 

  54. C. H. Li and C. E. Praeger, The finite simple groups with at most two fusion classes of every order, Comm. Algebra 24 (1996), 3681–1704.

    Article  MathSciNet  MATH  Google Scholar 

  55. C. H. Li and C. E. Praeger, Finite groups in which any two elements of the same order are either fused or inverse-fused, Research Report, Department of Mathematics, University of Western Australia, 1996.

    Google Scholar 

  56. C. H. Li and C. E. Praeger, On the isomorphism problem for finite Cayley graphs of bounded valency, preprint.

    Google Scholar 

  57. C. H. Li, C. E. Praeger and M. Y. Xu, Isomorphisms of finite Cayley digraphs of bounded valency, submitted.

    Google Scholar 

  58. C. H. Li, C. E. Praeger and M. Y. Xu, Finite groups with the Cayley isomorphism property, submitted.

    Google Scholar 

  59. M. W. Liebeck, The affine permutation groups of rank 3, Proc. London Math. Soc. (3) 54 (1987), 477–516.

    Article  MathSciNet  MATH  Google Scholar 

  60. M. W. Liebeck, C. E. Praeger and J. Saxl, Distance transitive graphs with symmetric or alternating automorphism group, Bull. Austral. Math. Soc. 35 (1987), 1–25.

    Article  MathSciNet  MATH  Google Scholar 

  61. M. W. Liebeck, C. E. Praeger and J. Saxl, On the ONan-Scott Theorem for finite primitive permutation groups, J. Austral. Math. Soc. Ser. A 44 (1988), 389–396.

    Article  MathSciNet  MATH  Google Scholar 

  62. R. A. Liebler, The classification of distance-transitive graphs of type q K m, European J. Combin. 12 (1991), 125–128.

    MathSciNet  MATH  Google Scholar 

  63. B. D. McKay, Transitive graphs with fewer than 20 vertices, Math. Comp. 33 (1979), 1101–1121.

    Article  MathSciNet  MATH  Google Scholar 

  64. B. D. McKay, Topics in Computational Graph Theory, PhD Thesis, University of Melbourne, 1980.

    Google Scholar 

  65. B. D. McKay, nauty Users guide (version 1.5), Technical Report TR-CS-90–02, Department of Computer Science, Australian National University, 1990.

    Google Scholar 

  66. J. McCorkindale, The 2-modular representation theory of PSU3(q), q = 3(mod 4 ), D. Phil. Thesis, University of Oxford, 1990.

    Google Scholar 

  67. B. D. McKay and G. F. Royle, The transitive graphs with at most 26 vertices, Ars Combin. 30 (1990), 161–176.

    MathSciNet  MATH  Google Scholar 

  68. M. Muzychuk, Adârns conjecture is true in the square-free case, J. Combin. Theory Ser. A 72 (1995), 118–134.

    Article  MathSciNet  Google Scholar 

  69. B. H. Neumann, Twisted wreath products of groups, Arch. Math. 14 (1963), 1–6.

    Article  MATH  Google Scholar 

  70. P. M. Neumann, Finite permutation groups, edge-coloured graphs, and matrices, in: Topics in Group Theory and Computation ( M. P. J. Curran, ed.), Academic Press, London, 1977, 82–116.

    Google Scholar 

  71. P. M. Neumann, G. A. Stoy and E. C. Thompson, Groups and Geometry, Oxford University Press, Oxford, (1994).

    MATH  Google Scholar 

  72. P. P. Palfy, Isomorphism problem for relational structures with a cyclic automorphism, European J. Combin. 8 (1987), 35–43.

    MathSciNet  MATH  Google Scholar 

  73. C. E. Praeger, Imprimitive symmetric graphs, Ars Combin. 19A (1985), 149–163.

    MathSciNet  Google Scholar 

  74. C. E. Praeger, The inclusion problem for finite primitive permtation groups, Proc. London Math. Soc. (3) 60 (1990), 68–88.

    Article  MathSciNet  MATH  Google Scholar 

  75. C. E. Praeger, An ONan-Scott Theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs, J. London Math. Soc. (2) 47 (1993), 227–239.

    Article  MathSciNet  Google Scholar 

  76. C. E. Praeger, On a reduction theorem for finite, bipartite, 2-arc transitive graphs, Australas. J. Combin. 7 (1993), 21–36.

    MathSciNet  MATH  Google Scholar 

  77. C. E. Praeger, Finite quasiprimitive graphs, submitted for the proceedings of the British Combinatorics Conference, 1997.

    Google Scholar 

  78. C. E. Praeger, J. Saxl and K. Yokohama, Distance transitive graphs and finite simple groups, Proc. London Math. Soc. (3) 55 (1987), 1–21.

    Article  MathSciNet  MATH  Google Scholar 

  79. C. E. Praeger and J. Wang, On primitive representations of finite alternating and symmetric groups with a 2-transitive subconstituent, J. Algebra 180 (1996), 808–833.

    Article  MathSciNet  MATH  Google Scholar 

  80. G. F. Royle, The transitive groups of degree 12, J. Symbolic Comput. 4 (1987), 255–268.

    Article  MathSciNet  MATH  Google Scholar 

  81. G. F. Royle and C. E. Praeger, Constructing the vertex transitive graphs of order 24, J. Symbolic Comput. 8 (1989), 309–326.

    Article  MathSciNet  MATH  Google Scholar 

  82. G. Sabidussi, Vertex-transitive graphs, Monatsh. Math. 68 (1964), 426–438.

    Article  MathSciNet  MATH  Google Scholar 

  83. J. Saxl, On multiplicity-free permutation representaions, Finite Geometries and Designs (P. J. Cameron, J. W. P. Hirschfeld and D. Hughes, eds.), London Math. Soc. Lecture Note Ser. 49, Cambridge University Press, Cambridge, 1981, 337–353.

    Google Scholar 

  84. L. L. Scott, Representations in characteristic p, Santa Cruz conference on finite groups, Proc. Sympos. Pure Math. 37 (1980), 318–331.

    Google Scholar 

  85. M. Suzuki, Group Theory I, Springer-Verlag, Berlin, 1982.

    MATH  Google Scholar 

  86. D. E. Taylor, Two-graphs and doubly transitive groups, J. Combin. Theory Ser. B 16 (1992), 113–122.

    Google Scholar 

  87. S. Toida, A note on Adams conjecture, J. Combin. Theory (B) 23 (1977), 239–246.

    Article  MathSciNet  MATH  Google Scholar 

  88. W. T. Tutte, A family of cubical graphs, Proc. Cambridge Philos. Soc. 43 (1947), 459474.

    Google Scholar 

  89. W. T. Tutte, On the symmetry of cubic graphs, Canad. J. Math. 11 (1959), 621–624.

    Article  MathSciNet  MATH  Google Scholar 

  90. R. Weiss, s-Transitive graphs, Colloq. Math. Soc. Jdnos Bolyai 25 (1978), 827–847.

    Google Scholar 

  91. R. Weiss, The non-existence of 8-transitive graphs, Combinatorica 1 (1983), 309–311.

    Article  Google Scholar 

  92. M. Y. Xu, Vertex-transitive graphs and finite simple groups, preprint (unpublished), 1988.

    Google Scholar 

  93. H. P. Yap, Point symmetric graphs with p 00000 13 points, Nanta Math. 6 (1986), 8–10.

    MathSciNet  Google Scholar 

  94. J. P. Zhang, On finite groups all of whose elements of the same order are conjugate in their automorphism groups, J. Algebra 153 (1992), 22–36.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Western Australia, Nedlands, WA, 6907, Australia

    Cheryl E. Praeger, Cai Heng Li & Alice C. Niemeyer

Authors
  1. Cheryl E. Praeger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cai Heng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alice C. Niemeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Départment d’Informatique et de Recherche opérationnelle, Université de Montréal, CP 6128, Succ. Centre-ville, H3C 3J7, Montréal, Québec, Canada

    Geňa Hahn

  2. Départment de Mathématiques et de Statistique, Université de Montréal, CP 6128, Succ. Centre-ville, H3C 3J7, Montréal, Québec, Canada

    Gert Sabidussi

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Praeger, C.E., Li, C.H., Niemeyer, A.C. (1997). Finite transitive permutation groups and finite vertex-transitive graphs. In: Hahn, G., Sabidussi, G. (eds) Graph Symmetry. NATO ASI Series, vol 497. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8937-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8937-6_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4885-1

  • Online ISBN: 978-94-015-8937-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation