The amidation reaction between C60 with an activated ester group (1) and acetylated Glc (AcGlc) with an amino group (2) was performed to yield the target AcGlc-pendant C60 compound (3). The water soluble deacetylated compound, Glc-pendant C60 compound (4), exhibited high photocytotoxicity against HeLa cells due to the more efficient singlet oxygen generation as compared with that of Glc-pendant...

We have synthesised a novel copper(ii) complex with a pyridine pendant as a proton relay port for electrocatalytic 4e(-) reduction of O2 in water. The enhancement of the electrocatalytic O2 reduction via protonation of the pyridine pendant is demonstrated in comparison with a copper(ii) complex without the pyridine pendant.

Here we denote a diameter six tree by (a0; a1, a2, . . . , am; b1, b2, . . . , bn; c1, c2, . . . , cr), where a0 is the center of the tree; ai, i = 1, 2, . . . ,m, bj , j = 1, 2, . . . , n, and ck, k = 1, 2, . . . , r are the vertices of the tree adjacent to a0; each ai is the center of a diameter four tree, each bj is the center of a star, and each ck is a pendant vertex. Here we give graceful...

T. S. Michael and N. Traves (2002) provided examples of wellcovered graphs whose independence polynomials are not unimodal. A. Finbow, B. Hartnell and R. J. Nowakowski (1993) proved that under certain conditions, any well-covered graph equals G∗ for some G, where G∗ is the graph obtained from G by appending a single pendant edge to each vertex of G. Y. Alavi, P. J. Malde, A. J. Schwenk and P. E...

The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found applications in optimization, navigation, network theory, image processing, pattern recognition etc. Several other authors have studied metric dimension of various standard graphs. In this paper we introduce a real valued function called generalized metric + → × × R X X X Gd : where = = ) / ( W v...

R. B. Gnanajothi, Topics in graph theory, Ph. D. thesis, Madurai Kamaraj University, India, 1991. E. M. Badr, On the Odd Gracefulness of Cyclic Snakes With Pendant Edges, International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol. 4, No. 4, December 2012. E. M. Badr, M. I. Moussa & K. Kathiresan (2011): Crown graphs and subdivision of l...

In a graph G = (V (G), E(G)), a vertex dominates itself and its neighbors. A subset S of V (G) is a double dominating set if every vertex of V (G) is dominated at least twice by the vertices of S. The double domination number of G is the minimum cardinality among all double dominating sets of G. We consider the effects of edge removal on the double domination number of a graph. We give a necess...

Synthetic terrain is a key element in many applications that can lessen the sense of realism if it is not handled correctly. We propose a new technique for visualizing terrain surfaces by tessellating them on the GPU. The presented algorithm introduces a new adaptive tessellation scheme for managing the level of detail of the terrain mesh, avoiding the appearance of t-vertices that can produce ...