purpose: to recognize affective factors in delivering x-ray contrast agents (which have high atomic number) via gallium carrier to liver or lymphatic neoplasm cells.   materials and methods: since uptake of gallium by liver has been reported in numerous researches, it was bonded with a contrast media (metrizoate). x-ray imaging was done to determine geometric features of liver.   results: radio...

let $g=(v‎, ‎e)$ be a graph with $p$ vertices and $q$ edges‎. ‎an emph{acyclic‎ ‎graphoidal cover} of $g$ is a collection $psi$ of paths in $g$‎ ‎which are internally-disjoint and cover each edge of the graph‎ ‎exactly once‎. ‎let $f‎: ‎vrightarrow {1‎, ‎2‎, ‎ldots‎, ‎p}$ be a bijective‎ ‎labeling of the vertices of $g$‎. ‎let $uparrow!g_f$ be the‎ ‎directed graph obtained by orienting the...

  Introduction: Radioimmunotherapy (RIT) is a very promising new therapy for the treatment of recurrent B-Cell non-Hodgkin's lymphoma (NHL). Iodine-131 is the most frequently used nuclide in clinical RIT, but its usefulness has been limited by dehalogenation of monoclonal antibodies labeled via conventional methods. To circumvent this problem, we have synthesized a tr...

99mTc-Macroaggregated Albumin (99mTc-MAA) has been used as a perfusion agent. This study described development of the 68Ga-MAA via commercially available kits from Pars-Isotopes Company as a 99mTc-MAA kit. 68Ge/68Ga generator was eluted with suprapure HCl (0.6 M, 6 mL) in 0.5 mL fractions. The two fractions with the highest 68GaCl3 activity were generally used for labeling purposes. After label...

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling   with $d$ labels  that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

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

Semantic labeling is an active field in remote sensing applications. Although handling high detailed objects in Very High Resolution (VHR) optical image and VHR Digital Surface Model (DSM) is a challenging task, it can improve the accuracy of semantic labeling methods. In this paper, a semantic labeling method is proposed by fusion of optical and normalized DSM data. Spectral and spatial featur...

An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...