2 citations · 3 across the 13 of their papers we have counts for
4 papers · 1 filter
-Domination invariants on Kneser graphs
Boštjan Brešar, María Gracia Cornet, Tanja Dravec +1
In this follow-up to [M.G.~Cornet, P.~Torres, arXiv:2308.15603], where the -tuple domination number and the 2-packing number in Kneser graphs were studied, we are conce…
Orientable total domination in graphs
Sarah E. Anderson, Tanja Dravec, Daniel Johnston +1
Given a directed graph , a set is a total dominating set of if each vertex in has an in-neighbor in . The total domination number of , denoted $…
Bounds on zero forcing using (upper) total domination and minimum degree
Boštjan Brešar, María Gracia Cornet, Tanja Dravec +1
While a number of bounds are known on the zero forcing number of a graph expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds…
Spreading in graphs
Boštjan Brešar, Tanja Dravec, Aysel Erey +1
Several concepts that model processes of spreading (of information, disease, objects, etc.) in graphs or networks have been studied. In many contexts, we assume that some vertices…