Tanja Dravec

activity

20212026

most citedGraphs with unique Grundy dominating sets

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

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

On the dissociation number of Kneser graphs

Boštjan Brešar, Tanja Dravec

A set $D$ of vertices of a graph $G$ is a dissociation set if each vertex of $D$ has at most one neighbor in $D$ . The dissociation number of $G$ , $d i ss (G)$ , is the cardinality of a…

math.CO2021★ 2 cited

Graphs with unique Grundy dominating sets

Boštjan Brešar, Tanja Dravec

Given a graph $G$ consider a procedure of building a dominating set $D$ in $G$ by adding vertices to $D$ one at a time in such a way that whenever vertex $x$ is added to $D$ there…