Publication date
January 2010
DOI Publisher
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona GoraAbstract
Nordhaus-Gaddum results for weakly convex domination number of a graph G are studied
Nordhaus-Gaddum results for weakly convex domination number of a graph G are studied
AbstractA Nordhaus–Gaddum-type result is a (tight) lower or upper bound on the sum or product of a p...
AbstractA set S of vertices of a connected graph G is a doubly connected dominating set if every ver...
A subset S of vertices in a graph G=(V,E) is a connected dominating set of G if every vertex of V\-S...
A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, ...
We study the Nordhaus-Gaddum type results for $(k-1,k,j)$ and $k$-domination numbers of a graph $G$ ...
AbstractLet i(G) (i(G), respectively) be the independent domination number (i.e. smallest cardinalit...
A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S ⊂ V is ...
Abstract Strong dominating amp61539- color number of a graph G is defined as the maximum number of c...
AbstractFor a graph G of order n, let γ(G), γ2(G) and γt(G) be the domination, double domination and...
summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the...
For a connected graph G = (V,E), a set D ⊆ V (G) is a dominating set of G if every vertex in V (G)−D...
AbstractThe distance dG(u,v) between two vertices u and v in a connected graph G is the length of th...
The maximum cardinality of a partition of the vertex set of a graph G into dominating sets is the do...
A Nordhaus-Gaddum problem for a graph parameter is to determine a tight lower or upper bound for the...
For a connected graph G = (V,E), a set D ⊆ V(G) is a dominating set of G if every vertex in V(G)-D h...
AbstractA Nordhaus–Gaddum-type result is a (tight) lower or upper bound on the sum or product of a p...
AbstractA set S of vertices of a connected graph G is a doubly connected dominating set if every ver...
A subset S of vertices in a graph G=(V,E) is a connected dominating set of G if every vertex of V\-S...
A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, ...
We study the Nordhaus-Gaddum type results for $(k-1,k,j)$ and $k$-domination numbers of a graph $G$ ...
AbstractLet i(G) (i(G), respectively) be the independent domination number (i.e. smallest cardinalit...
A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S ⊂ V is ...
Abstract Strong dominating amp61539- color number of a graph G is defined as the maximum number of c...
AbstractFor a graph G of order n, let γ(G), γ2(G) and γt(G) be the domination, double domination and...
summary:The domination number $\g(G)$ of a graph $G$ and two its variants are considered, namely the...
For a connected graph G = (V,E), a set D ⊆ V (G) is a dominating set of G if every vertex in V (G)−D...
AbstractThe distance dG(u,v) between two vertices u and v in a connected graph G is the length of th...
The maximum cardinality of a partition of the vertex set of a graph G into dominating sets is the do...
A Nordhaus-Gaddum problem for a graph parameter is to determine a tight lower or upper bound for the...
For a connected graph G = (V,E), a set D ⊆ V(G) is a dominating set of G if every vertex in V(G)-D h...
AbstractA Nordhaus–Gaddum-type result is a (tight) lower or upper bound on the sum or product of a p...
AbstractA set S of vertices of a connected graph G is a doubly connected dominating set if every ver...
A subset S of vertices in a graph G=(V,E) is a connected dominating set of G if every vertex of V\-S...
Add to ORKG