3 citations · 6 across the 13 of their papers we have counts for
4 papers · 1 filter
Z-domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
The Z-domination game is a variant of the domination game in which each newly selected vertex in the game must have a not yet dominated neighbor, but after the move all vertice…
Perfect graphs for domination games
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let and be the game domination number and the total game domination number of a graph , respectively. Then is -perfect (resp. -perfect), if…
Comparing Wiener complexity with eccentric complexity
Kexiang Xu, Aleksandar Ilić, Vesna Iršič +2
The transmission of a vertex of a graph is the sum of distances from to all the other vertices in . The Wiener complexity of is the number of different transmiss…
Maker-Breaker total domination game
Valentin Gledel, Michael A. Henning, Vesna Iršič +1
Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duchêne, Gledel, Parreau, and Renault.…