Abstract
Recently, Makhnev and Nirova found intersection arrays of distance-regular graphs with \(\lambda =2\) and at most 4096 vertices. In the case of primitive graphs of diameter 3 with \(\mu = 1\) there corresponding arrays are \(\{18,15,9;1,1,10\}\), \(\{33,30,8;1,1,30\}\) or \(\{39,36,4;1,1,36\}\). In this work, possible orders and subgraphs of fixed points of the hypothetical distance-regular graph with intersection array \(\{18,15,9;1,1,10\}\) are studied. In particular, graph with intersection array \(\{18,15,9;1,1,10\}\) is not vertex symmetric.
Similar content being viewed by others
References
Makhnev, A.A., Nirova, M.C.: On distance-regular graphs with \(\lambda =2\). J. Sib. Fed. Univ. 7(2), 188–194 (2014)
Makhnev, A.A., Paduchikh, D.V.: On automorphisms of distance-regular graph with itersection array \(\{24,21,3;1,3,18\}\). Algebra i Log. 435(3), 476–495 (2012)
Cameron, P.J.: Permutation Groups. London Mathematical Society Student Texts, vol. 45. Cambridge University Press, Cambridge (1999)
Gavrilyuk, A.L., Makhnev, A.A.: On automorphisms of distance-regular graph with itersection array \(\{56,45,1;1,9,56\}\). Dokl. Acad. Nauk 432(5), 512–515 (2010)
Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. Springer, Berlin Heidelberg New York (1989)
Zavarnitsine, A.V.: Finite simple groups with narrow prime spectrum. Sib. Electr. Math. Rep. 6, 1–12 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Makhnev, A.A., Paduchikh, D.V. On Automorphisms of Distance-Regular Graph with Intersection Array \(\{18,15,9;\,1,1,10\}\) . Commun. Math. Stat. 3, 527–534 (2015). https://doi.org/10.1007/s40304-015-0072-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40304-015-0072-z