Add to ORKGThe paper is concerned with dominating sets which arise naturally from a star partition of a finite graph. Techniques from linear algebra are used to construct certain graphs in which a dominating set is minimal. 1
A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus ...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
The paper begins with a new characterization of (k,τ)(k,τ)-regular sets. Then, using this result as ...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
International audienceA dominating set in a graph is a subset of vertices such that each vertex is e...
One of the most important problems in graph theory is to find the minimum values of domination param...
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 set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimu...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus ...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...
The paper begins with a new characterization of (k,τ)(k,τ)-regular sets. Then, using this result as ...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
International audienceA dominating set in a graph is a subset of vertices such that each vertex is e...
One of the most important problems in graph theory is to find the minimum values of domination param...
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 set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimu...
A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent t...
AbstractFor any graph G a set D of vertices of G is a dominating set, if every vertex v∈V(G)−D has a...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacen...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
A dominating set of a graph $G=(V,E)$ is a vertex set $D$ such that every vertex in $V(G) \setminus ...
A set D of vertices of a graph G is a dominating set if every vertex in V \ D is adjacent to some ve...
AbstractA set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V i...