4 papers
Isolation game on graphs
Boštjan Brešar, Tanja Dravec, Daniel P. Johnston +2
Given a graph and a family of graphs , an -isolating set, as introduced by Caro and Hansberg, is any set such that contains no member…
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…
On the chromatic edge stability index of graphs
Saieed Akbari, Arash Beikmohammadi, Boštjan Brešar +3
Given a non-trivial graph , the minimum cardinality of a set of edges in such that is called the chromatic edge stability index of , denoted…