Position:
Department:
Department of Mathematics (DM)
Room:
NB 628
eMail:
Phone:
+421 259 325 342
Research activities:
Algebraic graph theory, algebraic combinatorics.
Availability:

Publications

Book

  1. J. Korbaš – Š. Gyurki: Univerzita Komenského v Bratislave (in Slovak), Radlinského 9, 812 37 Bratislava, 2013.

Chapter or pages in book

  1. M. Kvasnica – I. Rauová – Š. Gyurki – M. Fikar: Least Invasive Stabilizing Correction of Arbitrary Controllers, In Selected Topics in Modelling and Control, Editor(s): J. Mikleš, V. Veselý, Slovak University of Technology Press Bratislava, no. 7, pp. 13–15, 2011.

Article in journal

  1. Š. Gyurki – P. Jánoš: On the automorphisms of a family of small q-regular graphs of girth 8. The Art of Discrete and Applied Mathematics, no. 1, vol. 6, 2023.
  2. Š. Gyurki – J. Mazák: An efficient algorithm for testing goal-minimality of graphs. Discrete Applied Mathematics, no. 161, pp. 1632–1634, 2013.
  3. Š. Gyurki: On the difference of the domination number of a digraph and of its reverse. Discrete Applied Mathematics, no. 160, pp. 1270–1276, 2012.
  4. Š. Gyurki: Constructing goal-minimally k-diametric graphs by lifts. Discrete Mathematics, no. 24, vol. 312, pp. 3547–3552, 2012.
  5. Š. Gyurki: Goal-minimally k-elongated graphs. Mathematica Slovaca, no. 2, vol. 59, pp. 193–200, 2009.

Article in conference proceedings

  1. Š. Gyurki – P. Jánoš – J. Šiagiová – J. Širáň: A connection between G-graphs and lifting construction. Editor(s): P. Gregor, J. Kratochvíl, M. Loebl, M. Pergel, In 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic, pp. 38–38, 2022.
  2. Š. Gyurki – P. Jánoš – J. Šiagiová – J. Širáň: On a relation between G-graphs and lifting construction. Editor(s): Š. Gyürki, S. Pavlíková, J. Širáň, In 56th Czech and Slovak Conference on Graph Theory, Slovak University of Technology, Bratislava Slovak Mathematical Society, Radlinskeho 11, Bratislava, pp. 29–29, 2021.
  3. Š. Gyurki: Two new infinite families and some sporadic examples of directed strongly regular graphs. Editor(s): Roman Nedela, Jan Karabas, In Graph Embeddings and Maps on Surfaces 2013 - Abstracts, Matej Bel University, Matej Bel University, Banska Bystrica, pp. 17–17, 2013.
  4. Š. Gyurki: On the difference of the domination number of a digraph and of its reverse. Editor(s): Ján Karabáš, In 46th Czech-Slovak Conference on Graph Theory -- Abstracts, pp. 20–20, 2011.
  5. Š. Gyurki: On Domination in Regular digraphs and in their Reverse. Editor(s): Klavdija Kutnar, Boštjan Kuzman, Primož Šparl, In Abstracts of the 7th International Conference on Graph Theory, pp. 151–151, 2011.
  6. Š. Gyurki: Goal-minimally k-diametric graphs. Editor(s): Dominique Buset, In 4th International Workshop on Optimal Network Topologies, pp. 12–12, 2011.
  7. Š. Gyurki – B. Štupáková: A generalization of Kyš's and Plesník's construction of goal-minimally k-diametric graphs. Editor(s): Jan Obdržálek, In Sborník abstraktu 45. česko-slovenské konference GRAFY 2010, University of Defence, Brno, pp. 23–23, 2010.
  8. Š. Gyurki: Goal-minimally k-diametric graphs from finite fields. Editor(s): Jan Karabas, In Graph Embeddings and Maps on Surfaces -- The Fifth Workshop, pp. 15–15, 2009.
  9. Š. Gyurki: Goal-minimally k-diametric graphs from finite fields. Editor(s): Martin Knor, In Czech and Slovak Conference GRAPHS 2009, Slovak Technical University Press, pp. 10–10, 2009.

Phd's thesis

  1. Š. Gyurki: Some constructions of minimal graphs with respect to diameter (in Slovak). KMANM FMFI UK v Bratislave, Mlynská dolina, 842 48 Bratislava, 2009.
Facebook / Youtube

Facebook / Youtube

RSS