HomeIssuesExplicit construction of infinite families of strongly regular digraphs with parameters ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t)

Explicit construction of infinite families of strongly regular digraphs with parameters ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t) | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. DOI: 10.17223/20710410/69/7

An explicit construction of infinite sequences of strongly regular graphs with parameter sets ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t) is described. A computer program was used to find the initial digraphs. The remaining terms of the sequence are obtained automatically by the constructed recurrent algorithm. Using the described approach, 11 families of strongly regular graphs have been found. In particular, these families contain digraphs dsrg(40,10, 3,1,3), dsrg(72,18, 5,3, 5), dsrg(76,19, 5,4, 5), dsrg(92,23,6, 5, 6) and dsrg(104,26, 7, 5, 7), the question of the existence of which was previously open.
Download file
Counter downloads: 1
  • Title Explicit construction of infinite families of strongly regular digraphs with parameters ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t)
  • Headline Explicit construction of infinite families of strongly regular digraphs with parameters ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t)
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 69
  • Date:
  • DOI 10.17223/20710410/69/7
Keywords
strongly regular digraph, recurrent sequence, exchange matrix, Kronecker product, Artelys Knitro
Authors
References
Bose R. С. Strongly regular graphs, partial geometries and partially balanced designs // Pacific J. Math. 1963. Y. 13. No.2. P.389-419.
Brouwer А. Е. and Maldeghem Н. V. Strongly Regular Graphs. Cambridge: Cambridge University Press, 2022. 425 p.
Duval A. M. A directed graph version of strongly regular graphs // J.Combinatorial Theory. Ser.A. 1988. V.47. No. 1. P.71-100.
Jprgensen L. K. Non-existence of directed strongly regular graphs // Discrete Math. 2003. V. 264. No. 1-3. P.111-126.
https://homepages.cwi.nl/~aeb/math/dsrg/dsrg.html Parameters of directed strongly regular graphs. 2025.
Zhang H. and Ding F. On the Kronecker products and their applications // J. Appl. Math. 2013. V. 2013. P. 1-8.
https://www.artelys.com/solvers/knitro/ Artelvs Knitro. 2025.
https://github.com/byzovv/dsrg_recurrent Explicit construction of infinite families of strongly regular digraphs. 2025.
Explicit construction of infinite families of strongly regular digraphs with parameters ((v + (2<sup>n+1</sup> - 4)t)2<sup>n-1</sup>,k + (2<sup>n</sup> - 2)t,t,λ,t) | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. DOI: 10.17223/20710410/69/7
Explicit construction of infinite families of strongly regular digraphs with parameters ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t) | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. DOI: 10.17223/20710410/69/7
Download full-text version
Counter downloads: 56