Štefan Gyürki

activity

20142026

most citedSporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version)

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2026

Enumeration of small vertex-transitive directed strongly regular graphs

A. E. Brouwer, Š. Gyürki

We find the 728 vertex-transitive directed strongly regular graphs with parameters $(v, k, t, λ, μ)$ where $1 \leq v \leq 39$ and $k < v /2$ and $0 < t < k$ . A table with parameters and a…

math.CO2026

An infinite family of intransitive directed strongly regular graphs with rank 6 Weisfeiler--Leman closure

Štefan Gyürki

We construct an infinite family of directed strongly regular graphs (DSRGs) with intransitive full automorphism groups whose Weisfeiler--Leman closure are association schemes of ra…

math.CO2026

Directed strongly regular graphs from groups, loops and quasigroups

Štefan Gyürki, Mikhail Klin

We introduce four infinite families of directed strongly regular graphs of orders $2 n^{2}$ and $3 n^{2}$ . The constructions are described in terms of groups, quasigroups, loops and thei…

math.CO2023

Orientably-regular embeddings of complete multigraphs

Stefan Gyurki, Sona Pavlikova, Jozef Siran

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embeddi…

math.CO2014★ 1 cited

Sporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version)

Štefan Gyürki, Mikhail Klin

We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the inve…