We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)

Proteoglycan metabolism was evaluated in megakaryocytes and platelets from guinea pigs fed a 1% cholesterol diet for 3 or 7 weeks. The animals were injected with a single dose of [35S]sulfate at the end of the feeding period, and megakaryocytes and platelets were isolated after 3 hours and then daily for 4 days thereafter. Proteoglycans were extracted from the cells of each animal and analyzed ...

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...

In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

Background: Possibility to trace-label albumin with isotopes results in information concerning its synthesis, breakdown, and distribution in the intra and extra cellular spaces. The iodination of albumin is a widespread procedure used in scientific studies. Bromine not only is more reactive and less expensive than iodine, but bonds more easily with many elements. Therefore, it could be a suitab...

background: possibility to trace-label albumin with isotopes results in information concerning its synthesis, breakdown, and distribution in the intra and extra cellular spaces. the iodination of albumin is a widespread procedure used in scientific studies. bromine not only is more reactive and less expensive than iodine, but bonds more easily with many elements. therefore, it could be a suitab...

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

background: gallium-66 (t1/2= 9.49 h) is an interesting radionuclide that has potential for positron emission tomography (pet) imaging of biological processes in intermediate to slow target tissue uptake. oxine has been labeled with this radioisotope in the form of [66ga]gallium chloride for its possible diagnostic properties. materials and methods: 66ga was produced in the 30 mev cyclotron (cy...

let g be a (p, q) graph. let k be an integer with 2 ≤ k ≤ p and f from v (g) to the set {1, 2, . . . , k} be a map. for each edge uv, assign the label |f(u) − f(v)|. the function f is called a k-difference cordial labeling of g if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...