Let G = (V, E) be an undirected graph with a set V of nodes and a set E of edges, |V | = n. A node v is said to distance-k dominate a node w if w is reachable from v by a path consisting of at most k edges. A set D ⊆ V is said a distance-k dominating set if every node can be distance-k dominated by some v ∈ D. The size of a minimum distance-k dominating set, denoted by γk(G), is called the dist...

For a nontrivial connected graph G, non-empty set S \(\subseteq\) V (G) is bipartite dominating of if the subgraph G[S] induced by and for every vertex not in dominated any S. The domination number denoted \(\gamma\)bip(G) G minimum cardinality G. In this paper, we determine exact crown its mycielski as well path cycle graphs.

For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...

In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating set problem, for a given set of objects as input, the objective is to choose minimum number of input objects such that every input object is dominated by the chosen set of objects. Here, one object is dominated by the other if both of them have non-empty intersection regi...

The top-k dominating query returns the k database objects with the highest score with respect to their dominance score. The dominance score of an object p is simply the number of objects dominated by p, based on minimization or maximization preferences on the attribute values. Each object (tuple) is represented as a point in a multidimensional space, and therefore, the number of attributes equa...

in this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. by using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. moreover, we investigate the ...

begin{abstract} in this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of hilbert spaces. we prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. the results present...

Paired domination is a relatively interesting concept introduced by Teresa W. Haynes [9] recently with the following application in mind. If we think of each vertex s ∈ S, as the location of a guard capable of protecting each vertex dominated by S, then for a paired domination the guards location must be selected as adjacent pairs of vertices so that each guard is assigned one other and they ar...

In this paper we introduce the concept of generalized weakly contractiveness for a pair of multivalued mappings in a metric space. We then prove the existence of a common fixed point for such mappings in a complete metric space. Our result generalizes the corresponding results for single valued mappings proved by Zhang and Song [14], as well as those proved by D. Doric [4].

In this paper, we introduce a new concept in set-valued mappings which we have called condition $(UHS)$. Then, adding this condition to a new type of contractive set-valued mappings, recently has been introduced by Amini-Harandi [Fixed and coupled fixed points of a new type contractive set-valued mapping in complete metric spaces, Fixed point theory and applications, 215 (2012)], we prove that ...