AbstractThe use of hypercube graphs as the underlying architecture in many commercial parallel computers has stimulated interest in this family of graphs. We hope to further stimulate this interest by introducing a tantalizing unsolved problem that is based on dominating sets for this very regularly structured family
AbstractWe study the independent dominating set problem restricted to graph classes defined by finit...
AbstractThe k-power domination problem generalizes domination and power domination problems. The k-p...
The paper considers the problem of computing a maximal independent set in a hypergraph (see [3] and ...
Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertice...
In this paper, we consider the independent dominating set polytope. We give a complete linear descri...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
We consider bounds on the minimum cardinality of an independent dominating set in regular graphs wit...
Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in...
A dominating set S of a graph G is perfect if each vertex of G is dominated by exactly one vertex in...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...
AbstractA vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices a...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A...
In this paper we present a new approach to solve the Minimum Independent Dominating Set pr...
AbstractWe study the independent dominating set problem restricted to graph classes defined by finit...
AbstractThe k-power domination problem generalizes domination and power domination problems. The k-p...
The paper considers the problem of computing a maximal independent set in a hypergraph (see [3] and ...
Hypercubes are a family of graphs defined by using all possible 0-1 sequences of length n as vertice...
In this paper, we consider the independent dominating set polytope. We give a complete linear descri...
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is a...
We consider bounds on the minimum cardinality of an independent dominating set in regular graphs wit...
Let G = (V, E) be a graph. A subset S subset of V of vertices is a dominating set if every vertex in...
A dominating set S of a graph G is perfect if each vertex of G is dominated by exactly one vertex in...
Abstract. The paper continues the study of independent set dominating sets in graphs which was start...
A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is a...
AbstractA vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices a...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A...
In this paper we present a new approach to solve the Minimum Independent Dominating Set pr...
AbstractWe study the independent dominating set problem restricted to graph classes defined by finit...
AbstractThe k-power domination problem generalizes domination and power domination problems. The k-p...
The paper considers the problem of computing a maximal independent set in a hypergraph (see [3] and ...
DOI
Add to ORKG