On distance regular graphs with diameter 3 and degree 44
Abstract
Distance-regular graph Γ with strongly regular graphs Γ2 and Γ3 has intersection array {r(c2 +1)+a3, rc2, a3 +1; 1, c2, r(c2 +1)} (M. S. Nirova). For distance-regular graph with diameter 3 and degree 44 there are 7 fisiable intersection arrays. For each of them the graph Γ3 is strongly regular. For intersection array {44,30,5;1,3,40} we have a3 = 4, c2 = 3 and r = 10, Γ2 has parameters (540, 440, 358, 360) and Γ3 has parameters (540, 55, 10, 5). This graph does not exist (Koolen-Park). For intersection array {44, 35, 3; 1, 5, 42} the graph Γ3 has parameters (375, 22, 5, 1). Graph Γ3 does nor exist (local subgraph is the union of isolated 6-cliques). In this paper it is proved that distance-regular graphs with intersection arrays {44, 36, 5; 1, 9, 40}, {44, 36, 12; 1, 3, 33} and {44, 42, 5; 1, 7, 40} do not exist.
About the Authors
M. ChenChina
Kheykou
A. A. Makhnev
Russian Federation
N. N. Krasovsky Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences
Yekaterinburg
V. S. Klimin
Russian Federation
Yekaterinburg
References
1. Brouwer A. E., Cohen A. M., Neumaier A. Distance-Regular Graphs. Berlin–Heidelberg–New York, Springer-Verlag, 1989.
2. Koolen J. H, Park J. Shilla distance-regular graphs. Europ. J. Comb., 2010, vol. 31, no. 8, pp. 2064–2073.
3. Coolsaet K., Jurishich A. Using equality in the Krein conditions to prove nonexistence of sertain
4. distance-regular graphs. J. Comb. Theory, Series A. 2008, vol. 115, pp. 1086–1095.
5. Berlekamp E. R., van Lint J. H., Seidel J. J. A strongly regular graph derived from the perfect ternary Golay code. Srivastava J. N. (Ed.). A survey of combinatorial theory. North-Holland Publishing Company, 1973, pp. 25–30.
Review
For citations:
Chen M., Makhnev A.A., Klimin V.S. On distance regular graphs with diameter 3 and degree 44. Proceedings of the Institute of Mathematics of the NAS of Belarus. 2024;32(1):57-63. (In Russ.)