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 math.COShow all

8 papers · 1 filter

math.CO2018

The variety of domination games

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

Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by…

math.CO2018

Toll number of the strong product of graphs

Tanja Gologranc, Polona Repolusk

A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the…

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…

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…