Tanja Gologranc

activity

20162018

most citedGrundy dominating sequences and zero forcing sets

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017

On Grundy total domination number in product graphs

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +6

A longest sequence $(v_{1}, \dots, v_{k})$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$ , $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\empty…

math.CO2017

Convex and isometric domination of (weak) dominating pair graphs

Boštjan Brešar, Tanja Gologranc, Tim Kos

A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$ , which is not in $D$ , has a neighbor in $D$ . A set of vertices $D$ in $G$ is convex (respectively, i…

math.CO2017★ 2 cited

Grundy dominating sequences and zero forcing sets

Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5

In a graph $G$ a sequence $v_{1}, v_{2}, \dots, v_{m}$ of vertices is Grundy dominating if for all $2 \leq i \leq m$ we have $N [v_{i}] \neq \subseteq \cup_{j = 1}^{i - 1} N [v_{j}]$ and is Grundy total do…