2 citations · 2 across the 13 of their papers we have counts for
4 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…
Maker-Breaker domination game
Eric Duchêne, Valentin Gledel, Aline Parreau +1
We introduce the Maker-Breaker domination game, a two player game on a graph. At his turn, the first player, Dominator, select a vertex in order to dominate the graph while the oth…
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…