3 citations · 6 across the 13 of their papers we have counts for
5 papers · 1 filter
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…