An infinite class of counterexamples is given to a conjecture of Dahme et al. [1] concerning the minimum size of a dominating vertex set that contains at least a prescribed proportion of the neighbors of each vertex not belonging to the set
A dominating set of G = (V, E) is a subset S of V such that every vertex in V − S has at least one n...
International audienceA dominating set in a graph is a subset of vertices such that each vertex is e...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
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...
International audienceA dominating set is a set S of vertices in a graph such that every vertex not ...
The domination number y of a graph G is the minimum cardinality of a subset D of vertices of G such ...
AbstractThe domination number γ of a graph G is the minimum cardinality of a subset D of vertices of...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices D⊆V such that for all v∈V−D the...
A dominating set D for a graph G is a subset of V(G) such that any vertex in V(G)-D has a neighbor i...
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex...
AbstractA total dominating set in a digraph G is a subset W of its vertices such that every vertex o...
AbstractA dominating set D of a graph G is a least dominating set (l.d.s) if γ(〈D〉) ⩽ γ(〈D1〉) for an...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A dominating set of G = (V, E) is a subset S of V such that every vertex in V − S has at least one n...
International audienceA dominating set in a graph is a subset of vertices such that each vertex is e...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
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...
International audienceA dominating set is a set S of vertices in a graph such that every vertex not ...
The domination number y of a graph G is the minimum cardinality of a subset D of vertices of G such ...
AbstractThe domination number γ of a graph G is the minimum cardinality of a subset D of vertices of...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices D⊆V such that for all v∈V−D the...
A dominating set D for a graph G is a subset of V(G) such that any vertex in V(G)-D has a neighbor i...
A set of vertices of a graph G is a total dominating set if each vertex of G is adjacent to a vertex...
AbstractA total dominating set in a digraph G is a subset W of its vertices such that every vertex o...
AbstractA dominating set D of a graph G is a least dominating set (l.d.s) if γ(〈D〉) ⩽ γ(〈D1〉) for an...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a verte...
A dominating set of G = (V, E) is a subset S of V such that every vertex in V − S has at least one n...
International audienceA dominating set in a graph is a subset of vertices such that each vertex is e...
AbstractA dominating set for a graph G=(V,E) is a subset of vertices V′⊆V such that for all v∈V−V′ t...
DOI
Add to ORKG