Distance-Transitive Graphs and Their Classification

  • A. A. Ivanov
Chapter
Part of the Mathematics and Its Applications book series (MASS, volume 84)

Abstract

In the present survey the classification problem of distance-transitive graphs is considered.

Keywords

Permutation Group Association Scheme Intersection Array Nonabelian Simple Group Incidence Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.A. Albert, Finite noncommutative division algebras, Proc. Amer. Math. Soc. 9 (1958), 928–932.MathSciNetCrossRefGoogle Scholar
  2. 2.
    R.E.L. Aldred & C.D. Godsil, Distance-regular antipodal covering graphs, J. Combin. Theory B45 (1988), 127–134.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    J.L. Alperin, On the theorem of Manning, Math. Z. 88 (1965), 434–435.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    C. Armanios, Symmetric graphs and their automorphism groups, Ph. D. Thesis, Univ. of Western Australia, Perth (1981).Google Scholar
  5. 5.
    M. Aschbacher, The nonexistence of rank three permutation group of degree 3250 and subdegree 57, J. Algebra 19 (1971), 538–540.MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    M. Aschbacher, On the maximal subgroups of the finite classical groups, Invent. Math. 76 (1984), 469–514.MathSciNetMATHGoogle Scholar
  7. 7.
    L. Babai, On the order of uniprimitive permutation groups, Ann. Math. 113 (1981), 553–568.MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    L. Babai, On the order of doubly transitive permutation groups, Invent. Math. 65 (1981), 473–486.Google Scholar
  9. 9.
    E. Bannai & E. Bannai, How many P-polynomial structures can an association scheme have? Europ. J. Comb., 1 (1980), 289–298.MathSciNetMATHGoogle Scholar
  10. 10.
    E. Bannai & T. Ito, Algebraic Combinatorics I. Association Schemes, Benjamin, Menlo Park, Ca. (1984).Google Scholar
  11. 11.
    E. Bannai & T. Ito, Current research on algebraic combinatorics, Graphs and Comb. 2 (1986), 287–308.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    E. Bannai & T. Ito, On distance-regular graphs with fixed valency, Graphs and Comb. 3 (1987), 95–109.MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    E. Bannai & T. Ito, On distance-regular graphs with fixed valency, II Graphs and Comb. 4 (1988), 219–228.MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    E. Bannai & T. Ito, On distance-regular graphs with fixed valency III J. Algebra 107 (1987), 43–52.MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    E. Bannai & T. Ito, On distance-regular graphs with fixed valency IV. Europ. J. Comb. 10 (1989), 137–148.MathSciNetMATHGoogle Scholar
  16. 16.
    N.L. Biggs, Three remarkable graphs, Canad. J. Math. 25 (1973), 397–411.MathSciNetMATHGoogle Scholar
  17. 17.
    N.L. Biggs, Algebraic Graph Theory, Cambridge Univ. Press (1974), Cambridge.Google Scholar
  18. 18.
    N.L. Biggs, The symmetry of line graphs, Util. Math. 5 (1974), 113–121.MathSciNetMATHGoogle Scholar
  19. 19.
    N.L. Biggs, Designs, factors and codes in graphs, Quart. J. Math. Oxford (2) 26 (1975), 113–119.MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    N.L. Biggs, Automorphic graphs and the Krein condition, Geom. dedic. 5 (1976), 117–127.MathSciNetMATHCrossRefGoogle Scholar
  21. 21.
    N.L. Biggs, Some odd graph theory, Annals New York Academy of Sciences 319 (1979), 71–81.MathSciNetCrossRefGoogle Scholar
  22. 22.
    N.L. Biggs & D.H. Smith, On trivalent graphs, Bull. London Math. Soc. 3 (1971), 155–158.MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    N.L. Biggs & A. Gardiner, The classification of distance transitive graphs (1974) [Unpublished manuscript].Google Scholar
  24. 24.
    N.L. Biggs, A.G. Boshier & J. Shawe-Taylor, Cubic distance-regular graphs, J. London Math. Soc. (2), 33 (1986), 385–394.MathSciNetMATHCrossRefGoogle Scholar
  25. 25.
    J. van Bon, On distance-transitive graphs and involutions,CWI Report PM-R8808, Amsterdam (1988).Google Scholar
  26. 26.
    J. van Bon, Private communication,(1989).Google Scholar
  27. 27.
    J. van Bon & A.E. Brouwer, The distance-regular antipodal covers of classical distance-regular graphs, pp. 141–166. In Colloq. Math. Soc Janos Bolyai, Proc. Eger 1987, (1988).Google Scholar
  28. 28.
    J. van Bon & A.M. Cohen, Prospective classification of distance transitive graphs, Proceedings of the Combinatorics 1988 conference at Ravello, (1988) 1–9.Google Scholar
  29. 29.
    J. van Bon & A.M. Cohen, Linear groups and distance-transitive graphs, Europ. J. Comb. 10 (1989), 399–412.MATHGoogle Scholar
  30. 30.
    J. van Bon, A.M. Cohen & H. Cuypers, Graphs related to Held’s simple group, J. Algebra, 123 (1989), 6–26.MathSciNetMATHCrossRefGoogle Scholar
  31. 31.
    A. Boshier & K. Nomura, A remark on the intersection arrays of distance-regular graphs,J. Combin. Theory B44 (1988) 147–153.Google Scholar
  32. 32.
    A.E. Brouwer, A.M. Cohen & A. Neumaier, Distance Regular Graphs, Springer Verlag, Berlin, 1989.MATHCrossRefGoogle Scholar
  33. 33.
    A.E. Brouwer & J. Hemmeter, New family of distance-regular graphs and the {0,1, 2}-cliques in dual polar graphs, Europ. J. Comb. 13 (1992), 71–80.MathSciNetMATHCrossRefGoogle Scholar
  34. 34.
    F. Buekenhout & P. Rowlinson, The uniqueness of certain automorphic graphs, Geom. dedic. 11 (1981), 443–446.MathSciNetMATHCrossRefGoogle Scholar
  35. 35.
    P.J. Cameron, Suborbits in transitive permutation groups,In: Combinatorial Group Theory, Math. Centre Tracts No 57 (1974), pp. 98–129, Amsterdam: D. Reidel.Google Scholar
  36. 36.
    P.J. Cameron, Finite permutation groups and finite simple groups, Bull. London Math. Soc. 13 (1981), 1–22.MathSciNetMATHCrossRefGoogle Scholar
  37. 37.
    P.J. Cameron, There are only finitely many distance-transitive graphs of given valency greater than two, Combinatorica 2 (1982), 9–13.MathSciNetMATHCrossRefGoogle Scholar
  38. 38.
    P.J. Cameron & C.E. Praeger, Graphs and permutation groups with projective sub-constituents, J. London Math. Soc. 25 (1982), 62–74.MathSciNetMATHCrossRefGoogle Scholar
  39. 39.
    P.J. Cameron. C.E. Praeger, J. Saxl & G.M. Seitz, On the Sims conjecture and distance-transitive graphs, Bull. London Math. Soc. 15 (1983), 499–506.Google Scholar
  40. 40.
    I.V. Chuvaeva & D.V. Pasechnik, Distance-transitive graphs of type q• Kq , q and projective planes, Europ. J. Comb. 11 (1990), 341–346.Google Scholar
  41. 41.
    A.M. Cohen, Geometries originating from certain distance-regular graphs, London Math. Soc. Lect. Notes Ser. 49 (1981), 81–87.Google Scholar
  42. 42.
    A.M. Cohen, A synopsis of known distance-regular graphs with larger diameters, Math. Cent. Afd. No 168 (1981).Google Scholar
  43. 43.
    A.M. Cohen, M.W. Liebeck & J. Saxl, The distance-transitive representations of the exceptional Lie groups,(1989) Preprint.Google Scholar
  44. 44.
    D.G. Djokovic, Automorphisms of graphs and coverings, J. Combin. Theory, Ser. B, 16 (1974), 243–247.Google Scholar
  45. 45.
    P.S. Fan, Amalgams of prime index, J. Algebra 98 (1986), 375–421.Google Scholar
  46. 46.
    I.A. Faradžev & A.A. Ivanov, Construction of distance-transitive representations of a group from its character table,(1988) Preprint, Intstitute for System Studies, Moscow [In Russian].Google Scholar
  47. 47.
    I.A. Faradžev & A.A. Ivanov, Distance-transitive representations of the groups G, PSL2(q) < G <_ PFL 2 (q), Europ. J. Comb. 11 (1990), 347–356.MATHGoogle Scholar
  48. 48.
    I.A. Faradžev, A.A. Ivanov & A.V. Ivanov, Distance-transitive graphs of valency 5, 6 and$17, Europ. J. Comb. 7 (1986), 303–319.Google Scholar
  49. 49.
    I.A. Faradžev, M.H. Klin & M.E. M:uzichuk, Cellular rings and automorphism groups of graphs (1991) [In this volume].Google Scholar
  50. 50.
    W. Feit & G. Higman, The non-existence of certain generalized polygons, J. Algebra, 1 (1964), 114–131.MathSciNetMATHCrossRefGoogle Scholar
  51. 51.
    J. Fischer & J. McKay, The nonabelian simple groups G, 1G I < 10 6 -maximal subgroups, Math. Comput. 32 (1978), 1293–1302.MATHGoogle Scholar
  52. 52.
    A. Gardiner, Arc transitivity in graphs, Quart. J. Math 24 (1973), 399–407.Google Scholar
  53. 53.
    A. Gardiner, Imprimitive distance-regular graphs and projective planes, J. Combin. Theory 16B (1974), 274–281.MathSciNetMATHCrossRefGoogle Scholar
  54. 54.
    A. Gardiner, On trivalent graphs, J. London Math. Soc. 10 (1975), 507–512.MathSciNetMATHCrossRefGoogle Scholar
  55. 55.
    A. Gardiner, Classifying distance-transitive graphs, Lecture Notes Math. 952 (1982), 67–88.MathSciNetCrossRefGoogle Scholar
  56. 56.
    A. Gardiner, An elementary classification of distance-transitive graphs of valency four, Ars Comb. 19A (1985), 129–141.MathSciNetGoogle Scholar
  57. 57.
    A. Gardiner & C.E. Praeger, Distance-transitive graphs of valency six, Ars Comb. 21A (1986), 195–210.MathSciNetGoogle Scholar
  58. 58.
    A. Gardiner & C.E. Praeger, Distance-transitive graphs of valency five, Proc. Edinburg Math. Soc. 30 (1987), 73–81.MathSciNetMATHGoogle Scholar
  59. 59.
    A.M. Gleason, Finite Fano planes, Amer. J. Math. 78 (1956), 797–807.Google Scholar
  60. 60.
    C.D. Godsil, Bounding the diameter of distance-regular graphs, Combinatorica, 8 (1988), 333–343.Google Scholar
  61. 61.
    D. Goldschmidt, Automorphisms of trivalent graphs,Ann. Math. 111 (1980), 377406.Google Scholar
  62. 62.
    L.M. Gordon & R. Levingstone, The construction of some automorphic graphs,Geom. Dedic. 10 (1981) 261–267.Google Scholar
  63. 63.
    M. Hall, A search for simple groups of order less than one million,In: Computation Problems in Abstract Algebra (1970), p. 137–168, Pergamon Press, London.Google Scholar
  64. 64.
    H. Hanani, On transversal designs, Math. Cent. Tracts 57 (1974), 43–53.Google Scholar
  65. 65.
    J. Hemmeter, Halved graphs, Hamming and Johnson graphs, Util. Math. 25 (1984), 115–118.MathSciNetMATHGoogle Scholar
  66. 66.
    J. Hemmeter, Distance-regular graphs and halved graphs, Europ. J. Comb. 7 (1986), 119–129.MathSciNetMATHGoogle Scholar
  67. 67.
    J. Hemmeter, The large cliques in the graph of quadratic forms, Europ. J. Comb. 9 (1988), 395–410.MathSciNetMATHGoogle Scholar
  68. 68.
    A.D. Hensel, Antipodal distance regular graphs, Master Thesis, Univ. of Waterloo, Waterloo, Ontario, 1988.Google Scholar
  69. 69.
    H. Higman, Finite permutation groups of rank 3, Math. Z. 86 (1964), 145–156.MathSciNetMATHCrossRefGoogle Scholar
  70. 70.
    N.F.J. Inglis, Multiplicity free permutation characters, distance-transitive graphs and classical groups, Ph. D. Thesis, University of Cambridge (1986).Google Scholar
  71. 71.
    N.F.J. Inglis, M.W. Liebeck & J. Saxl, Multiplicity free permutation representations of finite linear groups, Math. Z. 192 (1986), 329–337.MathSciNetMATHCrossRefGoogle Scholar
  72. 72.
    T. Ito, Bipartite distance-regular graphs of valency three, Linear Algebra Appl. 46 (1982), 195–213.MathSciNetMATHCrossRefGoogle Scholar
  73. 73.
    A.A. Ivanov, Construction by computer of some new automorphic graphs,In: Aerofizika i prikladnaia matematika (1981), pp. 144–146, Moscow: MFTI [In Russian].Google Scholar
  74. 74.
    A.A. Ivanov, Bounding the diameter of a distance-regular graph, Soviet Math. Dokl. 28 (1983), 149–152.MATHGoogle Scholar
  75. 75.
    A.A. Ivanov, Computing the lengths of orbits of a subgroup of a transitive permutation group,In: Methods for the Complex System Studies (1983), p. 3–7, Moscow: Institute for System Studies [In Russian, translation in this volume].Google Scholar
  76. 76.
    A.A. Ivanov, Combinatorial and algebraic methods for investigation of distance-regular graphs,Ph. D. Thesis (1984), Moscow: MFTI [In Russian].Google Scholar
  77. 77.
    A.A. Ivanov, Graphs of small girth and distance-transitive graphs,In: Methods for the Complex Systems Studies (1986), pp. 13–19, Moscow: Institute for System Studies [In Russian].Google Scholar
  78. 78.
    A.A. Ivanov, Graphs of girth 5 and diagram geometries related to the Petersen graph, In: Intern. Conf. on Finite Geom. and Comb. (1986), pp. 55–57, Gent, 1986.Google Scholar
  79. 79.
    A.A. Ivanov, Distance-transitive representations of the symmetric groups, J. Combin. Theory B41 (1986), 255–274.MATHGoogle Scholar
  80. 80.
    A.A. Ivanov, Graphs of girth 6 and a characterization of the odd graphs,In: Problems in Group Theory and Homological Algebra (1987), pp. 92–107, Yaroslavl [In Russian].Google Scholar
  81. 81.
    A.A. Ivanov, Graphs of girth 5 and diagram geometries related to the Petersen graph,Dokladi Acad. Nauk SSSR 295 (1987), 529–533 [In Russian, translated in Soviet Math. Dokl. 36 (1988), 83–87].Google Scholar
  82. 82.
    A.A. Ivanov, On 2-transitive graphs of girth 5, Europ. J. Comb. 8 (1987), 393–420.MATHGoogle Scholar
  83. 83.
    A.A. Ivanov, Distance-transitive graphs of affine type with projective subconstituent,In: Methods for the Complex Systems Studies (1988), pp. 9–10, Moscow: Institute for System Studies [In Russian].Google Scholar
  84. 84.
    A.A. Ivanov, The distance-transitive graphs admitting elation,Izvesti’a AN SSSR, 55 (1989), 971–1000. [In Russian, translated in: Mathematics of the USSR, Izvestiya, 35 (1990), 307–335.]Google Scholar
  85. 85.
    A.A. Ivanov & I.V. Chuvaeva, Fixed points method in the classification of distance-transitive graphs,In: Methods for the Complex Systems Studies (1985), pp. 3–10, Moscow: Institute for System Studies [In Russian].Google Scholar
  86. 86.
    A.A. Ivanov & I.V. Chuvaeva, Action of the group M12 on Hadamard matrices,In: Investigation in the Algebraic Theory of Combinatorial Objects (1985), pp. 159169, Moscow: Institute for System Studies [In Russian, translation in this volume].Google Scholar
  87. 87.
    A.A. Ivanov, I.A. Faradžev & F.L. Tchuda, Distance-transitive representations of the groups PSL2(q)In: Proc. of X all Union. Symp. on Group Theory (1986), p. 92, Minsk [In Russian].Google Scholar
  88. 88.
    A.A. Ivanov, I.A. Faradžev & F.L. Tchuda, Distance-transitive representations of the groups PSL2(q)In: Methods for the Complex Systems Studies (1988), pp. 1115, Moscow: Institute for System Studies [In Russian].Google Scholar
  89. 89.
    A.A. Ivanov & A.V. Ivanov, Distance-transitive graphs of valency k,8 ≤ k ≤ 13, London Math. Soc. Lect. Notes Ser. 131 (1988), 112–145.Google Scholar
  90. 90.
    A.A. Ivanov, A.V. Ivanov & I.A. Faradžev, Distance-transitive graphs of valency 5, 6 and 7, U.S.S.R. Comput. Maths. Math. Phys. 24 (1984), No 6, 67–76.Google Scholar
  91. 91.
    A.A. Ivanov, M.H. Klin & I.A. Faradžev, Primitive representations of nonabelian simple groups of order less than 10 6 , Part I,(1982) Preprint, Moscow: Institute for System Studies [In Russian].Google Scholar
  92. 92.
    A.A. Ivanov, M.H. Klin & I.A. Faradžev, Primitive representations of nonabelian simple groups of order less than 106, Part II,(1984) Preprint, Moscow: Institute for System Studies [In Russian].Google Scholar
  93. 93.
    A.A. Ivanov, M.H. Klin, S.V. Tsaranov & S.V. Shpectorov, On the problem of computing the subdegrees of transitive permutation groups, Uspehi. Mat. Nauk 38 (1983), No 6, 115–116 [In Russian, translated in: Russian Math. Surveys 38 (1983), 123–124].Google Scholar
  94. 94.
    A.A. Ivanov, M.E. Muzichuk & V.A. Ustimenko, On a new family of (P and Q)-polynomial schemes, Europ. J. Comb. 10 (1989), 337–346.Google Scholar
  95. 95.
    A.A. Ivanov & S.V. Shpectorov, Geometries for sporadic groups related to the Petersen graph I, Comm. Algebra 16 (1988), 925–954.Google Scholar
  96. 96.
    A.A. Ivanov & S.V. Shpectorov, Geometries for sporadic groups related to the Petersen graph II, Europ. J. Comb. 10 (1989), 347–362.Google Scholar
  97. 97.
    A.A. Ivanov & S.V. Shpectorov, The P-geometry for M23 has no nontrivial 2-coverings,Europ. J. Comb. 11 (1990), 373–379.Google Scholar
  98. 98.
    A.A. Ivanov & S.V. Shpectorov, Characterization of the association scheme of Hermitian forms over GF (22),Geom. Dedicata 30 (1989), 23–33.Google Scholar
  99. 99.
    A.A. Ivanov & S.V. Shpectorov, A characterization of the association schemes of Hermitian forms, J. Math. Soc. Japan 43 (1991), 25–48.Google Scholar
  100. 100.
    A.A. Ivanov & S.V. Shpectorov, Applications of group amalgams to algebraic graph theory ,(1991)[In this volume].Google Scholar
  101. 101.
    A.V. Ivanov, On some local characteristics of distance-transitive graphs, In: Investigations in the Algebraic Theory of Combinatorial Objects (1985), pp. 149–159, Moscow: Institute for System Studies [In Russian, translation in this volume].Google Scholar
  102. 102.
    W.M. Kantor, Classification of 2-transitive symmetric designs, Graphs and Comb. 1 (1985), 165–166.Google Scholar
  103. 103.
    W.M. Kantor & R.A. Liebler, The rank three representations of the classical groups, Trans. Amer. Math. Soc. 271 (1982) 1–71.MathSciNetMATHGoogle Scholar
  104. 104.
    P.B. Kleidman & M.W. Liebeck, A survey of the maximal subgroups of the finite simple groups, Geom. Dedic. 25 (1988), 375–389.MathSciNetMATHGoogle Scholar
  105. 105.
    M.W. Liebeck, On the orders of maximal subgroups of the finite classical groups, Proc. London Math. Soc. (3) 50 (1985), 426–446.MathSciNetMATHCrossRefGoogle Scholar
  106. 106.
    M.W. Liebeck, The affine permutation groups of rank three, Proc. London Math. Soc. (3) 54 (1987), 477–516.MathSciNetMATHCrossRefGoogle Scholar
  107. 107.
    M.W. Liebeck, C.E. Praeger & J. Saxl, Distance transitive graphs with symmetric and alternating automorphism groups, Bull. Austral. Math. Soc. 35 (1987), 1–25.MathSciNetMATHCrossRefGoogle Scholar
  108. 108.
    M.W. Liebeck & J. Saxl, On the orders of maximal subgroups of the finite exceptional groups of Lie type, Proc. London Math. Soc. (3) 55 (1987), 299–330.MathSciNetMATHCrossRefGoogle Scholar
  109. 109.
    M.W. Liebeck & J. Saxl, The finite primitive permutation groups of rank three, Bull. London Math. Soc. 18 (1986), 165–172.MathSciNetMATHCrossRefGoogle Scholar
  110. 110.
    M.W. Liebeck & C.E. Praeger & J. Saxl, On the O’Nan-Scott theorem for finite primitive permutation groups, J. Austral. Math. Soc. (Ser. A) 44 (1988), 389–396.MathSciNetMATHCrossRefGoogle Scholar
  111. 111.
    R.A. Liebler, The classification of distance-transitive graphs of type q. Kq , q, Europ. J. Comb. 12 (1991), 125–128.Google Scholar
  112. 112.
    H.D. Macpherson, Infinite distance-transitive graphs of finite valency, Combinatorica 2 (1982), 63–69.MathSciNetMATHCrossRefGoogle Scholar
  113. 113.
    B. Mortimer, The modular permutation representations of the known doubly transitive groups, Proc. London Math. Soc. 40 (1980), 1–20.MathSciNetGoogle Scholar
  114. 114.
    A. Neumaier, Rectagraphs, diagrams and Suzuki’s sporadic simple group, Annals of Discr. Math. 15 (1982), 305–318.MathSciNetMATHGoogle Scholar
  115. 115.
    W.L. Quirin, Primitive permutation groups with small orbitals, Math Z. 122 (1971), 267–274.MathSciNetMATHCrossRefGoogle Scholar
  116. 116.
    M. Perkel, Bounding the valency of polygonal graph with odd girth, Canad. J. Math. 31 (1979), 1307–1321.MathSciNetMATHGoogle Scholar
  117. 117.
    M. Perkel, A characterization of J1 in terms of its geometry, Geom. Dedic. 9 (1980), 289–298.MathSciNetGoogle Scholar
  118. 118.
    C.E. Praeger, Symmetric graphs and a characterization of the odd graphs, Lecture Notes Math. 829 (1980), 211–219.MathSciNetCrossRefGoogle Scholar
  119. 119.
    C.E. Praeger, Primitive permutation groups and a characterization of the odd graphs, J. Combin. Theory 31B (1981), 117–142.MathSciNetMATHCrossRefGoogle Scholar
  120. 120.
    C.E. Praeger, When are symmetric graphs characterized by their local properties?, Lecture Notes Math. 955 (1982), 123–141.MathSciNetCrossRefGoogle Scholar
  121. 121.
    C.E. Praeger, Primitive permutation groups with doubly transitive subconstituents, J. Austr. Math. Soc. (A), 45 (1988), 66–77.MathSciNetMATHCrossRefGoogle Scholar
  122. 122.
    C.E. Praeger, J. Saxl & K. Yokoyama, Distance transitive graphs and finite simple groups, Proc. London Math. Soc. (3) 55 (1987), 1–21.MathSciNetMATHCrossRefGoogle Scholar
  123. 123.
    J. Saxl, On multiplicity free permutation representations, London Math. Soc. Lect. Notes Ser. 49 (1981), 337–353.MathSciNetGoogle Scholar
  124. 124.
    S.V. Shpectorov, A geometric characterization of the group M22, In: Investigations in the Algebraic Theory of Combinatorial Objects (1985), pp. 112–123, Moscow: Insititute for System Studies [In Russian, translation in this volume].Google Scholar
  125. 125.
    C.C. Sims, Graphs and finite permutation groups I, Math. Z. 95 (1967), 76–86.MathSciNetMATHCrossRefGoogle Scholar
  126. 126.
    C.C. Sims, Graphs and finite permutation groups II, Math. Z. 103 (1968), 276–281.MathSciNetMATHCrossRefGoogle Scholar
  127. 127.
    D. H. Smith, Primitive and imprimitive graphs, Quart. J. Math. 22 (1971), 551–557.MATHCrossRefGoogle Scholar
  128. 128.
    D. H.Smith, On tetravalent graphs, J. London Math. Soc. 8 (1973), 659–662.CrossRefGoogle Scholar
  129. 129.
    D. H. Smith, Distance-transitive graphs of valency four, J. London Math. Soc. 8 (1974), 377–384.MathSciNetMATHCrossRefGoogle Scholar
  130. 130.
    D. H. Smith, On bipartite tetravalent graphs, Discrete Math. 10 (1974), 167–172.MathSciNetMATHCrossRefGoogle Scholar
  131. 131.
    D. H. Smith, Bounding the diameter of a distance-transitive graph, J. Combin. Theory, Ser. B. 16 (1974), 139–144.Google Scholar
  132. 132.
    B. Stellmacher, Rank 2 groups,In: Proceedings of the Rutgers Group Theory Year, 1983–1984 (1984), pp. 197–210, Cambridge: Cambridge Univ. Press.Google Scholar
  133. 133.
    D.E. Taylor & R. Levingstone, Distance-regular graphs, Lect. Notes Math. (1978), No 686, 313–323.CrossRefGoogle Scholar
  134. 134.
    F.L. Tchuda, Combinatorial-geometric characterizations of some primitive representations of the groups PSL n (q) for n = 2,3, Ph.D. Thesis, Kiev Univ. (1986) [In Russian].Google Scholar
  135. 135.
    F.L. Tchuda, Construction of an automorphic graph on 280 vertices using finite geometries,In: Investigations in the Algebraic Theory of Combinatorial Objects (1985), pp. 169–174, Moscow: Institute for System Studies [In Russian, translation in this volume].Google Scholar
  136. 136.
    P. Terwilliger, The diameter of bipartite distance-regular graphs, J Combin. Theory, Sec. B. 32 (1982), 182–188.MathSciNetMATHCrossRefGoogle Scholar
  137. 137.
    P. Terwilliger, Distance-regular graphs and (s,c,a,k)-graphs, J. Combin. Theory, Ser. B. 34 (1983), 151–164.MathSciNetMATHCrossRefGoogle Scholar
  138. 138.
    P. Terwilliger, Distance-regular graphs with girth 3 or 41, J. Combin. Theory, Ser. B. 39 (1985), 265–281.MathSciNetMATHCrossRefGoogle Scholar
  139. 139.
    J. Tits, Non-existence de certain polygons généralisés I et II, Invent. Math. 36 (1976, 1979), 275–284, 51, 267–269.Google Scholar
  140. 140.
    J. Tits, A local approach to buildings,In: The Geometric Vein (1981), Springer, pp. 519–547.Google Scholar
  141. 141.
    J. Tits, Buildings of Spherical Type and Finite BN-pairs,Lecture Notes Math. 386 (1974), Springer.Google Scholar
  142. 142.
    F. Timmesfeld, Tits’s geometries and parabolic systems in finite groups, Math. Z. 184 (1983), 377–396.MathSciNetMATHCrossRefGoogle Scholar
  143. 143.
    W.T. Tutte, A family of cubical graphs, Proc. Cambridge Phyl. Soc. 43 (1947), 459–474.MathSciNetMATHGoogle Scholar
  144. 144.
    Unsolved problems (1979) Summer Research Workship in Algebraic Combinatorics, Simon Fraser Univ.Google Scholar
  145. 145.
    V.A. Ustimenko, On some properties of geometries of Chevalley groups ‘and their generalizations,In: Investigations in t:he Algebraic Theory of Combinatorial Objects (1985), pp. 134–148, Moscow: Institute for System Studies [In Russian, translation of a revised version in this volume].Google Scholar
  146. 146.
    R. Weiss, Graphs with projective subconstituents, Proc. Amer. Math. Soc. 72 (1978), 312–317.CrossRefGoogle Scholar
  147. 147.
    R. Weiss, Elations of graphs, Acta Math. Sci. Hungar 34 (1979), 101–103.MATHCrossRefGoogle Scholar
  148. 148.
    R. Weiss, s-transitive graphs,In: Algebraic Methods in Graph Theory, Vol. 2 (1981), pp. 827–847, Amsterdam: North-Holland.Google Scholar
  149. 149.
    R. Weiss, The non-existence of 8-transitive graphs,Combinatorica 1 (1981), 309311Google Scholar
  150. 150.
    R. Weiss, Groups with a (B,N)-pair and locally transitive graphs,Nagoya Math. J. 74 (1982), 1–21.Google Scholar
  151. 151.
    R. Weiss, On distance-transitive graphs,Bull. London Math. Soc. 17 (1985), 253256.Google Scholar
  152. 152.
    R. Weiss, Distance-transitive graphs and generalized polygons, Arch. Math. 45 (1985), 186–192.MATHGoogle Scholar
  153. 153.
    R. Weiss, A characterization of the group M12, Algebra, Groups and Geometries 2 (1985), 555–563.Google Scholar
  154. 154.
    H. Wielandt, Finite Permutation Groups, Acad. Press (1964), New York.Google Scholar
  155. 155.
    W.J. Wong, Determination of a class of primitive groups,Math. Z. 99 (1967), 235246.Google Scholar
  156. 156.
    A. Yanushka, Generalized hexagons of order (t,t),Israel J. Math. 23 (1976), 309324.Google Scholar
  157. 157.
    K. Yokoyama, On distance-transitive graphs in which the stabilizer of a point contains an alternating group, Europ. J. Comb. 9 (1987), 379–390.MathSciNetGoogle Scholar
  158. 158.
    V.A. Zaichenko, An Algorithmic approach to the synthesis of combinatorial objects and computation in permutation groups using the method of invariant relations,Ph. D. Thesis (1981), Moscow: MFTI [In Russian].Google Scholar
  159. 159.
    V.A. Zaichenko, M.H. Kiin & I.A. Faradzev, On some questions concerning the representation of permutation groups in computer memory,In: Computation in Algebra, Number Theory and Combinatorics (1980), pp. 21–32, Kiev [In Russian].Google Scholar
  160. 160.
    V.A. Zaichenko, A.A. Ivanov & M.H. Klin, Construction and investigation of some new automorphic graphs,In: Methods and programs for solution of optimization problems on graphs and networks (1982), pp. 48–50, Novosibirsk [In Russian].Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1994

Authors and Affiliations

  • A. A. Ivanov

There are no affiliations available

Personalised recommendations