Ústav informatizácie, automatizácie a matematiky

Pracovné zaradenie:
Oddelenie:: Oddelenie matematiky (OM)
Miestnosť:: NB 628
eMail:
Telefón:: +421 259 325 342
Vedecká činnosť:: Algebraická teória grafov, algebraická kombinatorika.
Dostupnosť:

Publikácie

Kniha

J. Korbaš – Š. Gyurki: Prednášky z lineárnej algebry a geometrie, Radlinského 9, 812 37 Bratislava, 2013.

Kapitola alebo strany v knihe

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

Článok v časopise

Š. 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, č. 1, zv. 6, 2023.
Š. Gyurki – J. Mazák: An efficient algorithm for testing goal-minimality of graphs. Discrete Applied Mathematics, č. 161, str. 1632–1634, 2013.
Š. Gyurki: On the difference of the domination number of a digraph and of its reverse. Discrete Applied Mathematics, č. 160, str. 1270–1276, 2012.
Š. Gyurki: Constructing goal-minimally k-diametric graphs by lifts. Discrete Mathematics, č. 24, zv. 312, str. 3547–3552, 2012.
Š. Gyurki: Goal-minimally k-elongated graphs. Mathematica Slovaca, č. 2, zv. 59, str. 193–200, 2009.

Príspevok na konferencii

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

Dizertačná práca

Š. Gyurki: Konštrukcie minimálnych grafov vzhľadom k diametru. KMANM FMFI UK v Bratislave, Mlynská dolina, 842 48 Bratislava, 2009.

Publikácie

Kniha

Kapitola alebo strany v knihe

Článok v časopise

Príspevok na konferencii

Dizertačná práca

Najnovšie príspevky

Zaujímavé odkazy

Kontakt

Ústav informatizácie, automatizácie a matematiky

Mgr. Štefan Gyürki, PhD.

Publikácie

Kniha

Kapitola alebo strany v knihe

Článok v časopise

Príspevok na konferencii

Dizertačná práca

Najnovšie príspevky

Zaujímavé odkazy

Kontakt