Let α ∈ (0,1) and let $G = (V_G,E_G$) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3] a set $D ⊆ V_G$ is called an α-dominating set of G, if $|N_G(u) ∩ D| ≥ αd_G(u)$ for all $u ∈ V_G∖D$. We prove a series of upper bounds on the α-domination number of a graph G defined as the minimum cardinality of an α-dominating set of G
AbstractFor an integer-valued function ƒ defined on the vertices of a graph G, the ƒ-domination numb...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
AbstractLet G=(V,E) be a graph with no isolated vertex. A subset of vertices S is a total dominating...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
AbstractLet α∈(0,1) and let G=(VG,EG) be a graph. According to Dunbar et al. [α-Domination, Discrete...
A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least...
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
AbstractA dominating set D of a graph G is a least dominating set (l.d.s) if γ(〈D〉) ⩽ γ(〈D1〉) for an...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involv...
Given a graph with domination number γ, we find bounds on the maximum number of minimum dominating s...
AbstractFor an integer-valued function ƒ defined on the vertices of a graph G, the ƒ-domination numb...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
AbstractLet G=(V,E) be a graph with no isolated vertex. A subset of vertices S is a total dominating...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − ...
AbstractLet α∈(0,1) and let G=(VG,EG) be a graph. According to Dunbar et al. [α-Domination, Discrete...
A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least...
A set S of vertices of a graph G = (V,E) is a dominating set if every vertex of V-S is adjacent to s...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
AbstractA dominating set D of a graph G is a least dominating set (l.d.s) if γ(〈D〉) ⩽ γ(〈D1〉) for an...
A set D ⊆ V (G) is a dominating set of G if every vertex not in D is adjacent to at least one vertex...
AbstractWe are interested in a notion of domination related to both vertices and edges of graphs. We...
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involv...
Given a graph with domination number γ, we find bounds on the maximum number of minimum dominating s...
AbstractFor an integer-valued function ƒ defined on the vertices of a graph G, the ƒ-domination numb...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
A set S of vertices of a graph G = (V, E) is a dominating set if every vertex in V - S is adjacent t...
DOI
Add to ORKG