Add to ORKGUpper and lower bounds are obtained for the domination number of a graph, by means of a lemma involving the concept of a minimum dominating set of vertices. Although these results are obtained explicitly for graphs, there are analogous results in the theory of directed graphs. 1
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
Let α ∈ (0,1) and let $G = (V_G,E_G$) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3...
summary:Let $G$ be a graph with vertex set $V(G)$, and let $k\ge 1$ be an integer. A subset $D \subs...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
In this note, we prove several lower bounds on the domination num-ber of simple connected graphs. Am...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
. This paper compares several upper bounds based on the degree sequence of a graph G for the dominat...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
Let α ∈ (0,1) and let $G = (V_G,E_G$) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3...
summary:Let $G$ be a graph with vertex set $V(G)$, and let $k\ge 1$ be an integer. A subset $D \subs...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
M.Sc.Let G be a graph and D a set of vertices such that every vertex in G is in D or adjacent to at ...
In this note, we prove several lower bounds on the domination num-ber of simple connected graphs. Am...
The main theme of this BSc thesis are the domination sets and the corresponding domination number of...
A set D of vertices of a graph G = (VG, EG) is a dominating set of G if every vertex in VG — D is ad...
. This paper compares several upper bounds based on the degree sequence of a graph G for the dominat...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that ev...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
A set S of vertices in a graph G is a global dominating set of G if S simultaneously dominates both ...
Let α ∈ (0,1) and let $G = (V_G,E_G$) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3...
summary:Let $G$ be a graph with vertex set $V(G)$, and let $k\ge 1$ be an integer. A subset $D \subs...