Introduction: The radioimmunoscintigraphy (RIS) has found widespread clinical applications in  tumor  diagnosis.  Human  epithelial  mucin,  MUC1,  is  commonly  over  expressed  in  adenocarcinoma including 80% of breast cancers and represents a useful target for RIS. The PR81  is  a  new  murine  anti-MUC1  monoclonal  antibody  that  was  found  to  react  with  the  membrane  extracts of se...

introduction: the radioimmunoscintigraphy (ris) has found widespread clinical applications in  tumor  diagnosis.  human  epithelial  mucin,  muc1,  is  commonly  over  expressed  in  adenocarcinoma including 80% of breast cancers and represents a useful target for ris. the pr81  is  a  new  murine  anti-muc1  monoclonal  antibody  that  was  found  to  react  with  the  membrane  extracts of se...

a graph g is said to have a totally magic cordial labeling with constant c if there exists a mapping f : v (g) ∪ e(g) → {0, 1} such that f(a) + f(b) + f(ab) ≡ c (mod 2) for all ab ∈ e(g) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. in this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...

mean labelings are a type of additive vertex labeling. this labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. in this paper we focus on mean labelings of some graphs that are the result of the corona operation. in parti...

let g(v,e) be a graph with p vertices and q edges. a graph g is said to have an odd mean labeling if there exists a function f : v (g) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : e(g) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. a graph that admits an odd mean lab...

a graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ e(g)} consists of n integers. inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of g and k2 , and the disjoint :union: of g...