Washed rabbit platelets were resuspended in plasma in which all of the major phospholipids had been isotopically labeled by injection of 32PO4 into rabbits. At certain time intervals during a 6-hr incubation at 37 degrees C, aliquots were removed from the incubation mixture and the platelets were isolated and subjected to lipid extraction and phospholipid analysis. A continuous rise in platelet...

Maturity-onset diabetes of the young (MODY) is a form of NIDDM characterized by an early age of onset and autosomal-dominant inheritance (1). So far, three MODY-causing genes have been identified; namely, the hepatocyte nuclear factor4a (HNF-4a)/M0DYl on chromosome 20q, the glucokinase/M0DY2 on chromosome 7p, and the HNFla/M0DY3 on chromosome 12 q (2-4). The identification of the MODY genes has...

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