Current status of nanoscience research is briefly surveyed with special emphasis on monodisperse metal nanocrystals. Tunneling spectroscopy measurements on polymer protected magic nuclearity Pd561 nanocrystals have revealed single electron charging effects. Mesoscopic organizations resulting from self-assembly of these nanocrystals have been investigated. Giant clusters containing magic numbers...

Currently, the use of blood irradiation for inactivating pathogenic microbes in infected blood products and preventing graft-versus-host disease (GVHD) in immune suppressed patients is greater than ever before. In these systems, dose distribution and uniformity are two important concepts that should be checked. In this study, dosimetry of the gamma chamber blood irradiator model Gammacell 3000 ...

The proton spin-spin relaxation time (T2) during the bulk polymerization of methyl acrylate was measured as a function of the reaction time at various temperatures. Three kinds of T2 (T2L (long), T2S (short) and T2M (intermediate)) were obtained as the polymerization proceeded. The fraction of T2S (FS) increased sigmoidally at a certain reaction time, while that of T2L (FL) decreased reciprocal...

A (p,q) graph G is total edge-magic if there exits a bijection f: Vu E ~ {1.2,. .. ,p+q} such that for each e=(u,v) in E, we have feu) + fee) + f(v) as a constant. For a graph G, denote M(G) the set of all total edge-magic labelings. The magic strength of G is the minimum of all constants among all labelings in M(G), and denoted by emt(G). The maximum of all constants among M(G) is called the m...

Let A be an abelian group. We call a graph G = (V,E) A–magic if there exists a labeling f : E(G) → A− {0} such that the induced vertex set labeling f+ : V (G) → A, defined by f+(v) = Σf(u, v) where the sum is over all (u, v) ∈ E(G), is a constant map. For four classical products, we examine the A–magic property of the resulting graph obtained from the product of two A–magic graphs.

In this paper, a generalization of a group-magic graph is introduced and studied. Let R be a commutative ring with unity 1. A graph G = (V,E) is called R-ring-magic if there exists a labeling f : E → R−{0} such that the induced vertex labelings f : V → R, defined by f(v) = Σf(u, v) where (u, v) ∈ E, and f : V → R, defined by f(v) = Πf(u, v) where (u, v) ∈ E, are constant maps. General algebraic...

Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer μ such that ∑ u∈N(v) f(u) = μ for all v ∈ V, where N(v) is the open neighborhood of v. The constant μ is called the magic constant of the labeling f. Any graph which admits a distance magic labeling is called a distance magic graph. The bijection...

An edge magic labeling f of a graph with p vertices and q edges is a bijection f: V ∪ E → {1, 2, ..., p + q } such that there exists a constant s for any (x, y) in E satisfying f(x) + f(x, v) + f(y)= s. In this paper, the edge-magic labelings of ncm and some other graphs are discussed.