An inventory of the ethnobotanicals used as anti-diabetic by a rural community of Dhemaji district of Assam, Northeast India

Ethnopharmacological relevance: Traditional remedies used for treating diabetic ailments are very important in the primary health care of the people living in rural Dhemaji district of Assam, north-east India. Novel information gathered from the current survey is important in preserving folk indigenous knowledge. Materials and methods: Interviews were conducted amongst 80 households comprising of 240 individuals using semi-structured questionnaires. The focus was on plants used in treating diabetes mellitus. Results: The current survey documented 21 plant species (20 families) which are reportedly used to treat diabetes mellitus by the rural people in the study area. To the best of our knowledge, Amomum linguiforme, Cinnamomum impressinervium, Colocasia esculenta, Dillenia indica, Euphorbia ligularia, Garcinia pedunculata, Solanum indicum, Sterculia villosa and Tabernaemontana divaricata are recorded for the first time based on globally published literature as medicinal plants used for treating diabetes mellitus and related symptoms. Conclusions: The wide variety of plants that are used to treat diabetes mellitus in this area supports the traditional value that medicinal plants have in the primary health care system of the rural people of Dhemaji district of Assam. The finding of new plant uses in the current study reveals the importance of the documentation of such ethnobotanical knowledge. (C) 2011 Elsevier Ireland Ltd. All rights reserved.

Acyclic edge coloring of 2-degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). A graph is called 2-degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2-degenerate graphs properly contains seriesparallel graphs, outerplanar graphs, non - regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G)<=Delta + 2, where Delta = Delta(G) denotes the maximum degree of the graph. We prove the conjecture for 2-degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2-degenerate graph with maximum degree ?, then a'(G)<=Delta + 1. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 68:1-27, 2011

Immunotherapeutic efficacy of Mycobacterium indicus pranii in eliciting anti-tumor T cell responses: Critical roles of IFN gamma

Mycobacterium indicus pranii (MIP) is approved for use as an adjuvant (Immuvac/Cadi-05) in the treatment of leprosy. In addition, its efficacy is being investigated in clinical trials on patients with tuberculosis and different tumors. To evaluate and delineate the mechanisms by which autoclaved MIP enhances anti-tumor responses, the growth of solid tumors consisting of Sp2/0 (myeloma) and EL4 (thymoma) cells was studied in BALB/c and C57BL/6 mice, respectively. Treatment of mice with a single intra-dermal (i.d.) injection of MIP 3 days after Sp2/0 implantation greatly suppresses tumor growth. MIP treatment of tumor bearing mice lowers Interleukin (IL)6 but increases IL12p70 and IFN? amounts in sera. Also, increase in CD8+ T cell mediated lysis of specific tumor targets and production of high amounts of IL2 and IFN? by CD4+ T cells upon stimulation with specific tumor antigens in MIP treated mice is observed. Furthermore, MIP is also effective in reducing the growth of EL4 tumors; however, this efficacy is reduced in Ifn?-/- mice. In fact, several MIP mediated anti-tumor responses are greatly abrogated in Ifn?-/- mice: increase in serum Interleukin (IL)12p70 amounts, induction of IL2 and lysis of EL4 targets by splenocytes upon stimulation with specific tumor antigens. Interestingly, tumor-induced increase in serum IL12p70 and IFN? and reduction in growth of Sp2/0 and EL4 tumors by MIP are not observed in nonobese diabetic severe combined immunodeficiency mice. Overall, our study clearly demonstrates the importance of a functional immune network, in particular endogenous CD4+ and CD8+ T cells and IFN?, in mediating the anti-tumor responses by MIP.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

Tight co-degree condition for perfect matchings in 4-graphs

We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching.

Anti-obese activity of Butea monosperma (Lam) bark extract in experimentally induced obese rats

To study the efficacy of ethanolic extract of B. monosperma bark in cafeteria and atherogenic diet fed rats and monosodium glutamate (MSG) obese rats, different doses (200, 400 and 800 mg/kg) of ethanolic extract of B. monosperma bark showed dose dependent decrease in body weight, daily food intake, glucose, lipids, internal organs' weight and fat pad weight in cafeteria and atherogenic diet fed rats and monosodium glutamate obese rats. The results suggested that B. monosperma has significant anti-obese activity.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

Conformational Polymorphism in a Non-steroidal Anti-inflammatory Drug, Mefenamic Acid

For several years, the non-steroidal anti-inflammatory drug mefenamic acid, MA, has been known to exist as dimorphs (I and II). We report a new metastable polymorph (III) of MA obtained during attempted co-crystallization experiments and establish its stability relationship with existing forms. At elevated temperatures I and III convert to II, as evident from DSC experiments. On the basis of the lattice energy calculations in conjunction with thermal analysis, the stability order is proposed to be I > II > III at ambient conditions, whereas at elevated temperature the order is II > I > III. In either condition III is a metastable form and hence transforms to I at ambient conditions and to II at higher temperatures. Also we report the structural studies of a DMF solvate and a cytosine complex.

Algorithmic aspects of k-tuple total domination in graphs

For a fixed positive integer k, a k-tuple total dominating set of a graph G = (V. E) is a subset T D-k of V such that every vertex in V is adjacent to at least k vertices of T Dk. In minimum k-tuple total dominating set problem (MIN k-TUPLE TOTAL DOM SET), it is required to find a k-tuple total dominating set of minimum cardinality and DECIDE MIN k-TUPLE TOTAL DOM SET is the decision version of MIN k-TUPLE TOTAL DOM SET problem. In this paper, we show that DECIDE MIN k-TUPLE TOTAL DOM SET is NP-complete for split graphs, doubly chordal graphs and bipartite graphs. For chordal bipartite graphs, we show that MIN k-TUPLE TOTAL DOM SET can be solved in polynomial time. We also propose some hardness results and approximation algorithms for MIN k-TUPLE TOTAL DOM SET problem. (c) 2012 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Triangle-Free Planar Graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a'(G) ? ? + 2, where ? = ?(G) denotes the maximum degree of the graph. If every induced subgraph H of G satisfies the condition |E(H)| ? 2|V(H)|-1, we say that the graph G satisfies Property A. In this article, we prove that if G satisfies Property A, then a'(G) ? ? + 3. Triangle-free planar graphs satisfy Property A. We infer that a'(G) ? ? + 3, if G is a triangle-free planar graph. Another class of graph which satisfies Property A is 2-fold graphs (union of two forests). (C) 2011 Wiley Periodicals, Inc. J Graph Theory

DNA targeting polyaza macrobicyclic dizinc(II) complexes promoting high in vitro caspase dependent anti-proliferative activity against human carcinoma cancer cells

A series of macrobicyclic dizinc(II) complexes Zn2L1-2B](ClO4)(4) (1-6) have been synthesized and characterized (L1-2 are polyaza macrobicyclic binucleating ligands, and B is the N,N-donor heterocyclic base (viz. 2,2'-bipyridine (bipy) and 1,10-phenanthroline (phen)). The DNA and protein binding, DNA hydrolysis and anticancer activity of these complexes were investigated. The interactions of complexes 1-6 with calf thymus DNA were studied by spectroscopic techniques, including absorption, fluorescence and CD spectroscopy. The DNA binding constant values of the complexes were found to range from 2.80 x 10(5) to 5.25 x 10(5) M-1, and the binding affinities are in the following order: 3 > 6 > 2 > 5 > 1 > 4. All the dizinc(II) complexes 1-6 are found to effectively promote the hydrolytic cleavage of plasmid pBR322 DNA under anaerobic and aerobic conditions. Kinetic data for DNA hydrolysis promoted by 3 and 6 under physiological conditions give observed rate constants (k(obs)) of 5.56 +/- 0.1 and 5.12 +/- 0.2 h(-1), respectively, showing a 10(7)-fold rate acceleration over the uncatalyzed reaction of dsDNA. Remarkably, the macrobicyclic dizinc(II) complexes 1-6 bind and cleave bovine serum albumin (BSA), and effectively promote the caspase-3 and caspase-9 dependent deaths of HeLa and BeWo cancer cells. The cytotoxicity of the complexes was further confirmed by lactate dehydrogenase enzyme levels in cancer cell lysate and content media.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.