Three iridoids (lamalbid (I1), sesamoside (I2) and shanzhiside methyl ester (I3)) and seven polyphenols (cistanoside F (P1), chlorogenic acid (P2), pedalitin-6-O-laminaribioside (P3), pedaliin (P4), isoacteoside (P6), pedalitin (P7) and martynoside (P8)) were identified in young sesame leaves (Sesamum indicum L.) other than the acteoside (P5) reported previously. P3 was a new compound, and I1, ...

Lead is a highly toxic metal and a very strong poison. Lead poisoning usually occurs over a period of months or years. The poisoning can cause severe mental and physical impairment. Young children are most vulnerable to lead poisoning [1-2]. Lead poisoning is accompanied by an acquired deficiency of erythrocyte pyrimidine 5'nucleotidase (P5’N). Genetically determined deficiency of P5’N enzyme w...

To the Editor: We read with interest the innovative paper by Leveille and colleagues (1) discussing a new taxonomy of disability based on the most frequent self-reported symptoms. We agree with the authors that chronic disability in the older population has a multifactorial nature and it is difficult to ascertain a single cause. However, participants with moderate-to-severe cognitive impairment...

this study was conducted during two years (2007-2009) in shawoor agricultural research station on a silty-clay soil. experiment conducted in split plots in a randomized complete blocks design in three replications. main plots were planting methods including centrifugal broadcaster (p1), centrifugal broadcaster + furrower (p2), seed drill (p3), seed drill + furrower (p4), three lines bed drillin...

A graph G is called H-equicoverable if every minimal H-covering of G is also a minimum H-covering of G. In this paper, we investigate the characterization of P5-equicoverable graphs which contain cycles with length at least 5 and give some results of Pk-equicoverable graphs. Key–Words: P5-equicoverable,Pk-equicoverable,cycle,covering

Zverovich [Discuss. Math. Graph Theory 23 (2003), 159–162.] has proved that the domination number and connected domination number are equal on all connected graphs without induced P5 and C5. Here we show (with an independent proof) that the following stronger result is also valid: Every P5-free and C5-free connected graph contains a minimum-size dominating set that induces a complete subgraph.

We provide a certifying algorithm for the problem of deciding whether a P5-free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colorable and minimal with respect to this property.

A well-known conjecture asserts that smooth threefolds X ⊂ P5 are quadratically normal with the only exception of the Palatini scroll. As a corollary of a more general statement we obtain the following result, which is related to the previous conjecture: If X ⊂ P5 is not quadratically normal, then its triple curve is reducible.

INTRODUCTION The expression of substance P (SP) receptor (neurokinin 1, NK1) was studied in the rat corpus callosum (cc) from postnatal day 0 (the first 24 hr from birth, P0) to P30. METHODS We used immunocytochemistry to study the presence of intracallosal NK1-immunopositive neurons (NK1IP-n) during cc development. RESULTS NK1IP-n first appeared on P5. Their number increased significantly ...