The JavaScript world domination plan at 16 years

Let G=(V,E) be a graph. A set S@__ __V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V-S is adjacent to a vertex in V-S. A set S@__ __V is a restrained dominating set if every vertex in V-S is ...

In a graph G, a vertex is said to dominate itself and all of its neighbors. For a fixed positive integer k, the k-tuple domination problem is to find a minimum sized vertex subset in a graph such that every vertex in the graph is dominated by at least k ...

Let G be a graph with vertex set V(G) and edge set E(G). A set $D\subseteq V(G)$ is a dominating set of G if every vertex not in D is adjacent to at least one vertex of D. A restrained dominating set of G is a dominating set S such that every vertex not in S ...$$$$${}_{\mathrm{}}$${}_{\mathrm{}}$$$${}_{\mathrm{}}$${}_{\mathrm{}}$${}_{\mathrm{}}{}_{}$${}_{\mathrm{}}{}_{}$${}_{\mathrm{}}{}_{}{}_{\mathrm{}}{}_{}{}_{}$${}_{}$