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 2016Show all

3 papers · 1 filter

math.CO2016

Toll number of the Cartesian and the lexicographic product of graphs

Tanja Gologranc, Polona Repolusk

Toll convexity is a variation of the so-called interval convexity. A tolled walk $T$ between $u$ and $v$ in $G$ is a walk of the form $T : u, w_{1}, \dots, w_{k}, v,$ where $k \geq 1$ , in wh…

math.CO2016

Dominating sequences in grid-like and toroidal graphs

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

A longest sequence $S$ of distinct vertices of a graph $G$ such that each vertex of $S$ dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…

math.CO2016

Dominating sequences under atomic changes with applications in Sierpiński and interval graphs

Bostjan Bresar, Tanja Gologranc, Tim Kos

A sequence $S = (v_{1}, \dots, v_{k})$ of distinct vertices of a graph $G$ is called a legal sequence if $N [v_{i}] ∖ \cup_{j = 1}^{i - 1} N [v_{j}] \neq = \emptyset$ for any $i$ . The maximum l…