Stefan Gyürki

According to our database, Stefan Gyürki authored at least 9 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2024

Using bi-coset graphs to construct small regular and biregular graphs.

Stefan Gyürki, Robert Jajcay, Pavol János, Jozef Sirán, Yan Wang

Discret. Math., 2024

2022

On the automorphisms of a family of small q-regular graphs of girth 8.

Stefan Gyürki, Pavol János

Art Discret. Appl. Math., October, 2022

Goal-minimally k-diametric Graphs with not so Small Diameters.

Stefan Gyürki

Proceedings of the 22nd Conference Information Technologies, 2022

2017

Some new non-Schurian association schemes on 2p² points, p an odd prime, and related combinatorial structures.

Stefan Gyürki, Mikhail H. Klin

Australas. J Comb., 2017

2016

Infinite families of directed strongly regular graphs using equitable partitions.

Stefan Gyürki

Discret. Math., 2016

2014

Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation.

Stefan Gyürki, Mikhail H. Klin

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013

An efficient algorithm for testing goal-minimality of graphs.

Stefan Gyürki, Ján Mazák

Discret. Appl. Math., 2013

2012

Constructing goal-minimally k-diametric graphs by lifts.

Stefan Gyürki

Discret. Math., 2012

On the difference of the domination number of a digraph and of its reverse.

Stefan Gyürki

Discret. Appl. Math., 2012