For any integer  ‎, ‎a minus  k-dominating function is a‎function  f‎ : ‎V (G)  {-1,0‎, ‎1} satisfying w) for every  vertex v, ‎where N(v) ={u V(G) | uv  E(G)}  and N[v] =N(v)cup {v}. ‎The minimum of ‎the values of  v)‎, ‎taken over all minus‎k-dominating functions f,‎ is called the minus k-domination‎number and is denoted by $gamma_k^-(G)$ ‎. ‎In this paper‎, ‎we ‎introduce the study of minu...

plants in ancient fictional texts describe the  relation between low world and super worlds and appear in forms including ritual resurrection, human reincarnation in plant and vice versa, identification of human and plant , and etc which  relate human's spirit to supernatural. contemporary persian poets are taking advantage of a new language that is full of mythical concepts for expression...

Buckling restrained braced frames (BRBFs) for seismic load resistance have been widely used in recent years. One of the key requirements for a buckling restrained brace is to sustain large plastic deformations under severe ground motions. The core of a buckling restrained brace is prone to fatigue fracture under cyclic loading. The earthquake induced fracture type of the core plate in a bucklin...

A set S ⊆ V (G) is a disjunctive dominating of graph G if for every v ∈ (G)\S, neighbor vertex in or has at least two vertices each distance 2 from v. We say that restrained (G)\S there exists u \ such uv E(G) exist distinct u, w dG(u, v) = dG(w, v). The minimum cardinality γdr(G) the domination number G. In this paper, we characterize sets some binary operations as join, corona and lexico...

Let $kgeq 1$ be an integer, and let $G$ be a graph. A {it$k$-rainbow dominating function} (or a {it $k$-RDF}) of $G$ is afunction $f$ from the vertex set $V(G)$ to the family of all subsetsof ${1,2,ldots ,k}$ such that for every $vin V(G)$ with$f(v)=emptyset $, the condition $bigcup_{uinN_{G}(v)}f(u)={1,2,ldots,k}$ is fulfilled, where $N_{G}(v)$ isthe open neighborhood of $v$. The {it weight} o...

In this paper, we define a new domination-like invariant of graphs. Let $${\mathbb {R}}^{+}$$ be the set non-negative numbers. $$c\in {\mathbb {R}}^{+}-\{0\}$$ number, and let G graph. A function $$f:V(G)\rightarrow is c-self-dominating if for every $$u\in V(G)$$ , $$f(u)\ge c$$ or $$\max \{f(v):v\in N_{G}(u)\}\ge 1$$ . The c-self-domination number $$\gamma ^{c}(G)$$ defined as ^{c}(G):=\min \{...

We study, for a countably categorical theory T, the complexity of computing and the complexity of dominating the function specifying the number of n-types consistent with T.

Background: Considering the negative consequences of using physical restraints, we conducted this study to identify patients who are more frequently restrained in a psychiatric emergency ward as an initial step to limit the use of restraint to the minimum possible.   Methods: This was a retrospective case control study conducted in Iran Psychiatric Hospital in Tehran, Iran. We reviewed the f...