Abstract
Possible orders and subgraphs of the fixed points of a distance-regular graph with the intersection array {8, 7, 5; 1, 1, 4} are found. It is shown that such a graph is not vertex-transitive.
Similar content being viewed by others
References
P. J. Cameron, in Permutation Groups, London Math. Soc. Student Texts No. 45 (Cambridge Univ. Press, 1999).
A. A. Makhnev and D. V. Paduchikh, Algebra i Logika 40(2), 125 (2001).
A. A. Makhnev and V. V. Nosov, Mat. Sb. 185(3), 47 (2004).
A. A. Makhnev and I. M. Minakova, Discret. Matematika 16(1), 95 (2004).
A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs (Springer-Verlag, Berlin; Heidelberg, New York, 1989).
P. J. Cameron and J. van Lint, Graphs, Codes and Designs. London Math. Soc., Student Texts No. 22 (Cambridge Univ. Press, 1991).
A. S. Kondrat’yev and V. D. Mazurov, Sib. Mat. Zhurn. 41(2), 359 (2000).
J. Walter, Ann. Math. 89, 405 (1969).
E. Bombieri, Invent. Math. 58, 77 (1980).
D. Gorenstein and J. Walter, III. J. Math. 6 553 (1962); J. Algebra 2, 85–151; 218–270; 354–393 (1965).
Author information
Authors and Affiliations
Additional information
Original Russian Text © I.N. Belousov, A.A. Makhnev, 2007, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2007, Vol. 13, No. 1.
Rights and permissions
About this article
Cite this article
Belousov, I.N., Makhnev, A.A. A distance-regular graph with the intersection array {8, 7, 5; 1, 1, 4} and its automorphisms. Proc. Steklov Inst. Math. 257 (Suppl 1), S47–S60 (2007). https://doi.org/10.1134/S0081543807050033
Received:
Issue Date:
DOI: https://doi.org/10.1134/S0081543807050033