AbstractLet G=(V,E) be a simple graph. A set D⊆V is a dominating set of G if every vertex of V−D is adjacent to a vertex of D. The domination number of G, denoted by γ(G), is the minimum cardinality of a dominating set of G. We prove that if G is a Hamiltonian graph of order n with minimum degree at least six, then γ(G)≤6n17
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
AbstractFor a graph G, let σk(G) be the minimum degree sum of an independent set of k vertices. Ore ...
AbstractLet G=(V,E) be a simple graph. A set D⊆V is a dominating set of G if every vertex of V−D is ...
AbstractFor a graph G of order n, let γ(G), γ2(G) and γt(G) be the domination, double domination and...
AbstractA set S of vertices in a graph G is a dominating set of G if every vertex of V(G)∖S is adjac...
AbstractLet δ, γ, and α be respectively the minimum degree, the domination number and the independen...
A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is a...
summary:Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if fo...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set if every vertex of V−S is adjacent to ...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractA graph G is 3-domination-critical if its domination number γ is 3 and the addition of any e...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set (RDS) if every vertex not i...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
AbstractFor a graph G, let σk(G) be the minimum degree sum of an independent set of k vertices. Ore ...
AbstractLet G=(V,E) be a simple graph. A set D⊆V is a dominating set of G if every vertex of V−D is ...
AbstractFor a graph G of order n, let γ(G), γ2(G) and γt(G) be the domination, double domination and...
AbstractA set S of vertices in a graph G is a dominating set of G if every vertex of V(G)∖S is adjac...
AbstractLet δ, γ, and α be respectively the minimum degree, the domination number and the independen...
A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is a...
summary:Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if fo...
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its dominat...
AbstractLet G=(V,E) be a graph. A set S⊆V is a dominating set if every vertex of V−S is adjacent to ...
AbstractLet G=(V,E) be any graph with n vertices, m edges and no isolated vertices. For some α with ...
AbstractA graph G is 3-domination-critical if its domination number γ is 3 and the addition of any e...
AbstractLet G=(V,E) be a graph. A set S⊆V is a restrained dominating set (RDS) if every vertex not i...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
AbstractLet G=(V,E) be a simple graph. A subset S of V is a dominating set of G if for any vertex v∈...
AbstractFor a graph G, let σk(G) be the minimum degree sum of an independent set of k vertices. Ore ...
DOI
Add to ORKG