Add to ORKGFor a graph G = (V, E), X ⊆ V is a global dominating set if X dominates both G and the complement graph G. A set X ⊆ V is a packing if its pairwise members are distance at least 3 apart. The minimum number of vertices in any global dominating set is γ8(G), and the maximum number in any packing is ρ(G). We establish relationships between these and other graphical invariants, and characterize graphs for which p(G) = ρ(G). Except for the two self-complementary graphs on 5 vertices and when G or ̄ has isolated vertices, we show γg(G) ≤⌊n/2⌋, where n = |V|
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V(G) is a double dominating ...
For a graph G = (V, E), X ⊆ V is a global dominating set if X dominates both G and the complement gr...
For a graph G = (V, E), X subset of V is a global dominating set if X dominates both G and the compl...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
A dominating set of a graph G = (V, E) is a subset S ⊆ V such that every vertex not in S is adjacent...
A dominating set of a graph G = (V, E) is a subset S ⊆ V such that every vertex not in S is adjacent...
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
For any graph G = (V, E), D ⊆ V is a global dominating set if D dominates both G and its complement ...
A dominating set of a graph G = (V, E) is a subset S subset of V such that every vertex not in S is ...
A set D of vertices in a graph G = (V, E) is a dominating set of G if every vertex in V - D is adjac...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
A set S of vertices in a graph G is a global dominating set of G if 5 simultaneously dominates both ...
For a graph G = ( V , E ) , a set S ⊆ V is a dominating set if every vertex in V − S has at least a ...
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V(G) is a double dominating ...
For a graph G = (V, E), X ⊆ V is a global dominating set if X dominates both G and the complement gr...
For a graph G = (V, E), X subset of V is a global dominating set if X dominates both G and the compl...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
A dominating set of a graph G = (V, E) is a subset S ⊆ V such that every vertex not in S is adjacent...
A dominating set of a graph G = (V, E) is a subset S ⊆ V such that every vertex not in S is adjacent...
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
For any graph G = (V, E), D ⊆ V is a global dominating set if D dominates both G and its complement ...
A dominating set of a graph G = (V, E) is a subset S subset of V such that every vertex not in S is ...
A set D of vertices in a graph G = (V, E) is a dominating set of G if every vertex in V - D is adjac...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
A set S of vertices in a graph G is a global dominating set of G if 5 simultaneously dominates both ...
For a graph G = ( V , E ) , a set S ⊆ V is a dominating set if every vertex in V − S has at least a ...
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
In a graph G = (V, E), a set S ⊂ V is a dominating set if each vertex of V-S is adjacent to at least...
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V(G) is a double dominating ...