Add to ORKGIn this paper we obtain some bounds for outer connected domination numbers and global outer connected domination numbers of graphs
In this article we study some variants of the domination concept attending to the connectivity of th...
Abstract. A total outer-independent dominating set of a graph G = (V (G), E(G)) is a set D of vertic...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $...
A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset...
Let G = (V,E) be a graph. Set D ⊆ V(G) is a total outer-connected dominating set of G if D is a tota...
In this article we study some variants of the domination concept attending to the connectivity of th...
A subset S of vertices in a graph G = (V,E) is a dominating set if every vertex in V-S is adjacent t...
A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
Let G = (V; E) be a graph. Set D V (G) is a total outer-connected dominating set of G if D is a tot...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
In this article we study some variants of the domination concept attending to the connectivity of th...
Abstract. A total outer-independent dominating set of a graph G = (V (G), E(G)) is a set D of vertic...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
AbstractLet G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if...
Let G be a graph. A set D ⊆ V(G) is a global dominating set of G if D is a dominating set of G and $...
A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset...
Let G = (V,E) be a graph. Set D ⊆ V(G) is a total outer-connected dominating set of G if D is a tota...
In this article we study some variants of the domination concept attending to the connectivity of th...
A subset S of vertices in a graph G = (V,E) is a dominating set if every vertex in V-S is adjacent t...
A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset...
AbstractA dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjac...
Let G = (V; E) be a graph. Set D V (G) is a total outer-connected dominating set of G if D is a tot...
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Ci...
We initiate the study of total outer-independent domination in graphs. A total outer-independent dom...
In this article we study some variants of the domination concept attending to the connectivity of th...
Abstract. A total outer-independent dominating set of a graph G = (V (G), E(G)) is a set D of vertic...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...