Jul 6, 2009 · A set D of vertices of a graph G is a (vertex) dominating set if each vertex in V − D is adjacent to at least one vertex in D . The (vertex) ...
scholar.google.com › citations
Feb 23, 2009 · A set D of vertices of a graph G is a (vertex) dominating set if each vertex in V − D is adjacent to at least one vertex in. D. The (vertex) ...
In a graph G a vertex v dominates all its neighbors and itself. A set D of vertices of G is (vertex) dominating set if each vertex of G is dominated by at ...
Jun 27, 2019 · A vertex subset S of a graph G=(V,E) is a [1,2]-dominating set if each vertex of V\backslash S is adjacent to either one or two vertices in S.
In a graph G a vertex v dominates all its neighbors and itself. A set D of vertices of G is (vertex) dominating set if each vertex of G is dominated by at ...
each vertex in V − S is adjacent to at least two vertices in S. The 2-domination number of G is the cardinality of the smallest 2-dominating set of G. In this ...
Jul 31, 2016 · A set S of vertices of a graph G = (V, E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex ...
Jun 27, 2019 · A vertex subset S of a graph G = (V, E) is a [1, 2]-dominating set if each vertex of. V \S is adjacent to either one or two vertices in S.
Abstract: A total dominating set of a graph G is a set of the vertex set V of G such that every vertex of G is adjacent to a vertex in S. In this paper, ...
Abstract. In a graph G a vertex v dominates itself and its neigh- borhood. A domatic partition in a graph G is a partition of V (G).