Let k ≥ 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function (STIkDF) on a graph G is a functionf : V (G) → {−1, 1, 2} satisfying the conditions that $sum_{xin N(v)}f(x)ge k$ for each vertex v ∈ V (G), where N(v) is the neighborhood of $v$, and each vertex u with f(u)=-1 is adjacent to a vertex v with f(v)=2 or to two vertic...

abstract. suppose g is an nvertex and medge simple graph with edge set e(g). an integervalued function f: e(g) → z is called a flow. tutte was introduced the flow polynomial f(g, λ) as a polynomial in an indeterminate λ with integer coefficients by f(g,λ) in this paper the flow polynomial of some dendrimers are computed.

‎we consider two commutativity ratios $pr(g)$ and $f(g)$ in a finite group $g$‎ ‎and examine the properties of $g$ when these ratios are `large'‎. ‎we show that‎ ‎if $pr(g) > frac{7}{24}$‎, ‎then $g$ is metabelian and we give threshold‎ ‎results in the cases where $g$ is insoluble and $g'$ is nilpotent‎. ‎we also‎ ‎show that if $f(g) > frac{1}{2}$‎, ‎then $f(g) = frac{n+1}{2n}$‎, ‎for some‎ ‎na...

Process capability of a process is defined as inherent variability of a process which is running under chance cause of variation only. Process capability index is measuring the ability of a process to meet the product specification limit. Generally process capability is measured by 6 assuming that the product characteristic follows Normal distribution. In many practical situations the product ...

A double Roman dominating function on a graph $G$ with vertex set $V(G)$ is defined in cite{bhh} as a function$f:V(G)rightarrow{0,1,2,3}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least twoneighbors assigned 2 under $f$ or one neighbor $w$ with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must haveat least one neighbor $u$ with $f(u)ge 2$. The weight of a double R...