Automorphisms of a graph with intersection array {nm − 1, nm− n + m − 1, n − m + 1; 1, 1, nm− n + m − 1} are considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin (1989).
A. A. Makhnev and M. S. Nirova, “Distance-regular Shilla graphs with b2 = c2,” Mat. Zametki, 103, No. 5, 730-744 (2018).
A. A. Makhnev, M. P. Golubyatnikov, andWenbin Guo, “Inverse problems in distance-regular graphs: Nets,” Comm. Math. Stat., 7, No. 1, 69-83 (2019).
K. S. Efimov and A. A. Makhnev, “Automorphisms of a distance-regular graph with intersection array {39, 36, 4; 1, 1, 36},” Ural Math. J., 4, No. 2, 69-78 (2018).
R. C. Bose and T. A. Dowling, “A generalization of Moore graphs of diameter two,” J. Comb. Th., Ser. B, 11, 213-226 (1971).
A. L. Gavrilyuk and A. A. Makhnev, “On automorphisms of a distance-regular graph with intersection array {56, 45, 1; 1, 9, 56},” Dokl. AN, 432, No. 5, 583-587 (2010).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 59, No. 5, pp. 567-581, September-October, 2020. Russian DOI: https://doi.org/10.33048/alglog.2020.59.504.
A. A. Makhnev is Supported by Russian Science Foundation, project No. 19-71-10067.
M. P. Golubyatnikov is Supported by Russian Science Foundation, project No. 19-71-10067.
Rights and permissions
About this article
Cite this article
Makhnev, A.A., Golubyatnikov, M.P. Automorphisms of a Graph With Intersection Array {nm − 1, nm− n + m − 1, n − m + 1;1, 1, nm− n + m − 1}. Algebra Logic 59, 385–394 (2020). https://doi.org/10.1007/s10469-020-09611-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-020-09611-x