7 citations · 20 across the 23 of their papers we have counts for
1 paper · 2 filters
Tınaz Ekim, Arthur Farley, Andrzej Proskurowski +1
k-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on verti…