DISTANCE TRANSITIVE GRAPHS AND FINITE SIMPLE GROUPS

@inproceedings{Praeger1987DISTANCETG,
  title={DISTANCE TRANSITIVE GRAPHS AND FINITE SIMPLE GROUPS},
  author={Cheryl E. Praeger and Jan Saxl and Kazuhiro Yokoyama},
  year={1987}
}
This paper represents the first step in the classification of finite primitive distance transitive graphs. In it we reduce the problem to the case where the automorphism group is either almost simple or affine. Let ^ be a simple, connected, undirected graph with vertex set Q. If oc, /? e Q, then d(a, j8) denotes the distance between a and /3 in §. Let G be some group of automorphisms of §. Then ^ is G-distance transitive if for any two pairs of vertices \<xu a2) and (ft, ft) with d(aly a2) = d… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 36 REFERENCES

A synopsis of known distance-regular graphs with large diameters

  • A. M. COHEN
  • Mathematical Centrum ZW165/81,
  • 1981
Highly Influential
1 Excerpt

LIEBECK, 'The affine permutation groups of rank three

  • M W.
  • Proc. London Math. Soc. (3)
  • 1987
2 Excerpts

PRAEGER, 'Distance transitive graphs of valency five

  • C.E.A. GARDINER
  • Proc. Edinburgh Math. Soc
  • 1987
1 Excerpt

SAXL, 'On the orders of maximal subgroups of the finite exceptional groups of Lie type

  • J.M.W. LIEBECK
  • Proc. London Math. Soc. (3)
  • 1987
1 Excerpt

PRAEGER, 'Distance transitive graphs of valency six

  • C.E.A. GARDINER
  • Ars Combin
  • 1986
1 Excerpt

SAXL, 'The primitive permutation groups of rank 3

  • J.M.W. LIEBECK
  • Bull. London Math. Soc
  • 1986
1 Excerpt

An elementary classification of distance transitive graphs of valency four

  • A. GARDINER
  • Ars Combin
  • 1985
1 Excerpt

CHUVAYEVA, Methods for complex system studies

  • I.V.A.A. IVANOV
  • (Moscow Institute for System Studies,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…