Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...

F-index of a graph is the sum of the cube of the degrees of the vertices. In this paper, we investigate the F-indices of unicyclic graphs by introducing some transformation, and characterize the unicyclic graphs with the first five largest F-indices and the unicyclic graphs with the first two smallest F-indices, respectively.

A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...

General Preex Computation (GPC) problem has been shown to be the kernel routine that captures the hardest part of parallel algorithms in elds such as computer graphics, medical imaging, databases, and computational geometry. We present the rst computation and communication optimal algorithm on Coarse Grained Multicomputers (CGM) for solving GPC and, speciically, present its application on paral...

For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...

Monoclonal antibodies that selectively bind to pancreatic tumors may be useful in the therapy and diagnosis of pancreatic carcinoma. In this study we have examined the tumor localization of radioiodinated DU-PAN 1, a mouse monoclonal antibody that is selective for a human pancreatic cancer-associated antigen. After radiolabeling, both DU-PAN 1 intact monoclonal antibody and F(ab')2 fragments re...

Let $K$ be a subgroup of finite group $G$ . The probability that an element commutes with is denoted by $Pr(K,G)$ Assume $Pr(K,G)\geq \epsilon$ for some fixed $\epsilon >0$ We show there normal $T\leq G$ and $B\leq K$ such the indices $[G:T]$ $[K:B]$ order commutator $[T,B]$ are $\epsilon$ -bounded. This extends well-known theorem, due to P. M. Neumann, covers case where $K=G$ deduce number ...