For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$‎, ‎we define a‎ ‎function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating‎ ‎function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least‎ ‎$k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$‎. ‎The minimum weight of a Roman $k$-tuple dominatin...

1. Laertes is about to stab Hamlet. Claudius, watching from the wings, desperately wants Laertes to stab Hamlet and has implanted a device in Laertes’ brain that, if activated, will force him to stab Hamlet. Claudius intends to activate the device if it appears that Laertes will change his mind at the last moment. Laertes, however, stabs Hamlet of his own accord and Claudius’s device is never a...

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

let (x, d) be a compact metric space and f : x → x be a continuous map. consider the metric space (k(x),h) of all non empty compact subsets of x endowed with the hausdorff metric induced by d. let ¯ f : k(x) → k(x) be defined by ¯ f(a) = {f(a) : a ∈ a} . we show that block-coppels chaos in f implies block-coppels chaos in ¯ f if f is a bijection.

Let $D$ be a finite and simple digraph with vertex set $V(D)$‎.‎A signed total Roman $k$-dominating function (STR$k$DF) on‎‎$D$ is a function $f:V(D)rightarrow{-1‎, ‎1‎, ‎2}$ satisfying the conditions‎‎that (i) $sum_{xin N^{-}(v)}f(x)ge k$ for each‎‎$vin 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 a...

in  this paper, we investigate the generalizedhyers-ulam-rassias stability for the quartic, cubic and additivefunctional equation$$f(x+ky)+f(x-ky)=k^2f(x+y)+k^2f(x-y)+(k^2-1)[k^2f(y)+k^2f(-y)-2f(x)]$$ ($k in mathbb{z}-{0,pm1}$) in $p-$banach spaces.

Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...