Ripley’s K(t) function is a tool to analyze completely mapped spatial point process data. Spatial point process data consists of the locations of events. These are usually recorded in 2 dimensions, but they may be locations along a line or in space. Here I will only describe K(t) for 2 dimensional spatial data. Completely mapped data includes the locations of all events in a predefined study ar...

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...

We introduce an algorithm to compute the functions belonging a suitable set F defined as follows: f∈F means that f(s,x), s∈A⊂R being fixed and x>0, has power series expansion centred at x0=1 with convergence radius greater or equal than 1; moreover, it satisfies functional equation of step 1 Euler-Maclaurin summation formula can be applied f. Denoting Euler gamma-function Γ, we will show that, ...

In the article, the completely monotonic results of the functions [Γ(x+ 1)]1/x, [Γ(x+α+1)]1/(x+α) [Γ(x+1)]1/x , [Γ(x+1)]1/x (x+1)α and [Γ(x+1)]1/x xα in x ∈ (−1,∞) for α ∈ R are obtained. In the final, three open problems are posed.

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...