[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 García, Suitberto; Cabrera Martinez, Abel; Hernandez Mira, Frank A.; Yero, Ismael G.(Informa UK (National Inquiry Services Center), 2021-03-04)
[EN] Given a graph G = (V, E), a function f: V -> {0, 1, 2} is a total Roman {2}-dominating function if every vertex v is an element of V for which f (v) = 0 satisfies that n-ary sumation (u)(is an element of N (v)) f (v) ...