[EN] In a graph G, a vertex dominates itself and its neighbours. A subset S subset of V(G) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double ...
Cabrera-Martínez, Abel; Conchado Peiró, Andrea(American Institute of Mathematical Sciences, 2022-03-31)
[EN] Let G be a nontrivial graph and k ¿ 1 an integer. Given a vector of nonnegative integers
w = (w0,...,wk), a function f : V(G) ¿ {0,..., k} is a w-dominating function on G if f(N(v)) ¿ wi
for every v ¿ V(G) such that ...