Let G = (V,E) be a simple and undirected graph. For some integer k > 1, a set D ⊆ V is said to be a k-dominating set in G if every vertex v of G outside D has at least k neighbors in D. Furthermore, for some real number α with 0 < α 6 1, a set D ⊆ V is called an α-dominating set in G if every vertex v of G outside D has at least α×dv neighbors in D, where dv is the degree of v in G. The cardina...

We investigate the domination number and total domination number of the graph K q (n; k) whose vertices are all the k-subspaces of an n-dimensional vector space over a eld with q elements and whose edges are the pairs fU; Wg of vertices such that U \ W = f0g. Bounds are obtained in general and exact results are obtained for n k 2 +k?1 and in other cases when q is suuciently large relative to n ...

Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1, such a set is called a dominating set of G. The Smarandachely domination k -number γk(G) of G is the minimum cardinality of a Smarandachely dominating k -set of G. S is called weak domination set if ...

For many graphs parameters, criticality is a fundamental issue. For domination number, Brigham, Chinn, and Dutton began the study of graphs where the domination number decreases on the removal of any vertex. Brigham, Haynes, Henning, and Rall defined the term (γ, k)-critical and proved results for graphs that are (γ, 2)-critical or bicritical. A graph G is said to be (γ, k)-critical if γ(G − S)...

Using hypergraph transversals it is proved that γt(Qn+1) = 2γ(Qn), where γt(G) and γ(G) denote the total domination number and the domination number of G, respectively, and Qn is the n-dimensional hypercube. More generally, it is shown that if G is a bipartite graph, then γt(G K2) = 2γ(G). Further, we show that the bipartiteness condition is essential by constructing, for any k > 1, a (non-bipa...

Let D be a finite and simple digraph with vertex set V (D). A signed total Roman k-dominating function (STRkDF) on D is a function f : V (D) → {−1, 1, 2} satisfying the conditions that (i) ∑ x∈N−(v) f(x) ≥ k for each v ∈ V (D), where N−(v) consists of all vertices of D from which arcs go into v, and (ii) every vertex u for which f(u) = −1 has an inner neighbor v for which f(v) = 2. The weight o...

A set S of vertices is defined to be a power dominating set (PDS) of a graph G if every vertex and every edge in G can be monitored by the set S according to a set of rules for power system monitoring. The minimum cardinality of a PDS of G is its power domination number. In this article, we find upper bounds for the power domination number of some families of Cartesian products of graphs: the c...

We consider families of analytic functions with Taylor coefficients-polynomials in the parameter λ: fλ(z) = ∑∞ k=0 ak(λ)z k, ak ∈ C[λ]. Let R(λ) be the radius of convergence of fλ. The “Taylor domination” property for this family is the inequality of the following form: for certain fixed N and C and for each k ≥ N + 1 and λ, |ak(λ)|R(λ) ≤ C max i=0,...,N |ai(λ)|R(λ). Taylor domination property ...

A graph G is dot-critical if contracting any edge decreases the domination number. It is totally dot-critical if identifying any two vertices decreases the domination number. Burton and Sumner [Discrete Math. 306 (2006) 11–18] posed the problem: Is it true that for k 4, there exists a totally k-dot-critical graph with no critical vertices? In this paper, we show that this problem has a positive...