Add to ORKGThe details of this abstract can be found in the full paper.Key words: Subdivision graph, Block subdivision graph, Connected domination number
International audienceAs a generalization of connected domination in a graph G we consider dominatio...
A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adja...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
For any graph = , , block graph is a graph whose set of vertices is the union of the set o...
A set D of vertices in a graph G = (V; E) is a weakly connected dominating set of G if D is dominati...
A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominatin...
In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V ...
Given a simple finite graph G=(V,E), a vertex subset D ? V(G) is said to be a dominating set of G if...
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at le...
AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicycli...
The domination subdivision number of a graph is the minimum number of edges that must be subdivided ...
AbstractA set D of vertices of a connected graph G=(V,E) is called a connected k-dominating set of G...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
AbstractA set S of vertices of a graph G=(V,E) is a dominating set if every vertex of V(G)∖S is adja...
summary:A dominating set in a graph $G$ is a connected dominating set of $G$ if it induces a connect...
International audienceAs a generalization of connected domination in a graph G we consider dominatio...
A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adja...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...
For any graph = , , block graph is a graph whose set of vertices is the union of the set o...
A set D of vertices in a graph G = (V; E) is a weakly connected dominating set of G if D is dominati...
A set D of vertices in a graph G = (V,E) is a weakly connected dominating set of G if D is dominatin...
In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V ...
Given a simple finite graph G=(V,E), a vertex subset D ? V(G) is said to be a dominating set of G if...
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at le...
AbstractArumugam and Paulraj Joseph (Discrete Math 206 (1999) 45) have characterized trees, unicycli...
The domination subdivision number of a graph is the minimum number of edges that must be subdivided ...
AbstractA set D of vertices of a connected graph G=(V,E) is called a connected k-dominating set of G...
Let G be a simple graph, and let p be a positive integer. A subset D ⊆ V(G) is a p-dominating set of...
AbstractA set S of vertices of a graph G=(V,E) is a dominating set if every vertex of V(G)∖S is adja...
summary:A dominating set in a graph $G$ is a connected dominating set of $G$ if it induces a connect...
International audienceAs a generalization of connected domination in a graph G we consider dominatio...
A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adja...
If G = (V E) is a nite simple connected graph, a subset S of V is said to be a dominating set of the...