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

MaRDI QIDQ6889547zbMATH OpenFDO

Authors V. A. Byzov, I. A. Pushkarev

Publication date 4 December 2025

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

zbMATH Keywords

exchange matrixKronecker productrecurrent sequencestrongly regular digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75) Association schemes, strongly regular graphs (05E30)

Cites work

• A directed graph version of strongly regular graphs
• Non-existence of directed strongly regular graphs
• On the Kronecker products and their applications
• Strongly regular graphs
• Strongly regular graphs, partial geometries and partially balanced designs

This page was built for publication: Explicit construction of infinite families of strongly regular digraphs with parameters \(((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889547)