3 citations · 4 across the 13 of their papers we have counts for
4 papers · 1 filter
A proof of the -conjecture for independent domination in cubic graphs
Boštjan Brešar, Tanja Dravec, Michael A. Henning
A set of vertices in a graph is a dominating set of if every vertex not in is adjacent to a vertex in~. An independent dominating set in is a dominating set…
Injective (edge) colorings of generalized Sierpiński graphs
C. K. Bhanupriya, Boštjan Brešar
Generalized Sierpiński graphs constitute a distinctive class of fractal-like networks with recursive definition: given a graph , while is obtained from $|V(G)|…
On -coalition in graphs: bounds and exact values
Boštjan Brešar, Michael A. Henning, Babak Samadi
Given a graph $G=\big{(}V(G),E(G)\big{)}$, a set is called a -dominating set if every vertex in has at least neighbors in . Two disjoi…
On polluted bootstrap percolation in Cartesian grids
Boštjan Brešar, Jaka Hedžet, Michael A. Henning
Given a graph and assuming that some vertices of are infected, the -neighbor bootstrap percolation rule makes an uninfected vertex infected if has at least i…