3 citations · 6 across the 13 of their papers we have counts for
20 papers
Cops and Robber on Hyperbolic Manifolds
Vesna Iršič, Bojan Mohar, Alexandra Wesolek
The Cops and Robber game on geodesic spaces is a pursuit-evasion game with discrete steps which captures the behavior of the game played on graphs, as well as that of continuous pu…
General position polynomials
Vesna Iršič, Sandi Klavžar, Gregor Rus +1
A subset of vertices of a graph is a general position set if no triple of vertices from the set lie on a common shortest path in . In this paper we introduce the general pos…
Indicated domination game
Boštjan Brešar, Csilla Bujtás, Vesna Iršič +2
Motivated by the success of domination games and by a variation of the coloring game called the indicated coloring game, we introduce a version of domination games called the indic…
Generalized Pell graphs
Vesna Iršič, Sandi Klavžar, Elif Tan
In this paper, generalized Pell graphs , , are introduced. The special case of are the Pell graphs defined earlier by Munarini. Several metric, enume…
Domination and independence number of large -crossing-critical graphs
Vesna Iršič, Maruša Lekše, Mihael Pačnik +2
After -crossing-critical graphs were characterized in 2016, their most general subfamily, large -connected -crossing-critical graphs, has attracted separate attention. Thi…
Predominating a vertex in the connected domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph.…
-conjectures on the domination game and claw-free graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar
Let be the game domination number of a graph . Rall conjectured that if is a traceable graph, then . Our main re…
Total connected domination game
Csilla Bujtás, Michael A. Henning, Vesna Iršič +1
The (total) connected domination game on a graph is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirem…
The domination game played on diameter 2 graphs
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
Let be the game domination number of a graph . It is proved that if , then $γ_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(…
On Rall's -conjecture on the domination game
Csilla Bujtás, Vesna Iršič, Sandi Klavžar +1
The -conjecture on the domination game asserts that if is a traceable graph, then the game domination number of is at most $\left\lceil \frac{n(G)}{2} \right\…
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.…
Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
Valentin Gledel, Vesna Iršič
The strong geodetic number, of a graph is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices…
Maker-Breaker domination number
Valentin Gledel, Vesna Iršič, Sandi Klavžar
The Maker-Breaker domination game is played on a graph by Dominator and Staller. The players alternatively select a vertex of that was not yet chosen in the course of the g…
Strong geodetic problem on complete multipartite graphs
Vesna Iršič, Matjaž Konvalinka
The strong geodetic problem is to find the smallest number of vertices such that by fixing one shortest path between each pair, all vertices of the graph are covered. In this paper…
Strong geodetic cores and Cartesian product graphs
Valentin Gledel, Vesna Iršič, Sandi Klavžar
The strong geodetic problem on a graph is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of a…
Effect of predomination and vertex removal on the game total domination number of a graph
Vesna Iršič
The game total domination number, , was introduced by Henning et al.\ in 2015. In this paper we study the effect of vertex predomination on the game total domination n…
Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
Vesna Iršič
The strong geodetic problem is a recent variation of the classical geodetic problem. For a graph , its strong geodetic number is the cardinality of a smallest vert…