Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Simultaneous separation and analysis of two bioactive xanthones in the Tibetan medicinal plant Gentianopsis paludosa (Hook. f.) Ma by micellar electrokinetic capillary chromatography

Cheng Y. Q., Zhang Y. X, Qi S. D., Chen H. L., Chen X. G.

Acta Chromatographica

2010

Vol. 22, no. 4

637--650

1,7-Dihydroxy-3,8-dimethoxyxanthone (X1) and 1,8-dihydroxy-3,7-dimethoxyxanthone (X2) are two important xanthones of the Tibetan medicinal plant Gentianopsis paludosa (Hook. f.) Ma. They are very similar in structure, the only difference being exchange of OH and OCH 3 at the 7 and 8 positions. By calculations based on the geometry of the molecules using the MM+ force field, the different distances between the hydroxyl groups of the two xanthones were obtained (4.64774 Å for X2 and 7.19412 Å for X1), therefore, the two hydroxyl groups of X1 should freely interact with more water molecules than those of X2 in aqueous solution. In other words, X2 is more hydrophobic than X1. Micellar electrokinetic capillary chromatography (MEKC) was therefore chosen for separation of the compounds. The optimum separation conditions were: 20 mM borate + 20 mM SDS (pH 9.8) as running buffer, 17.5 kV applied potential, and detection wavelength 260 nm. The two xanthones were well separated in 9.0 min, with Gaussian peak shapes. The repeatability of the MEKC method (expressed as RSD) for X1 and X2 was 0.9 and 1.1%, respectively, for migration time, and 3.1 and 1.4% for peak area. The limits of detection ( S/N = 3) were 0.41 μg mL -1 for X1 and 0.82 μg mL -1 for X2. The recovery of the MEKC method for the two xanthones was also satisfactory.

Tree domatic number in graphs

Chen X. G.

Opuscula Mathematica

2007

Vol. 27, no. 1

5-11

A dominating set S in a graph G is a tree dominating set of G if the subgraph induced by S is a tree. The tree domatic number of G is the maximum number of pairwise disjoint tree dominating sets in V(G). First, some exact values of and sharp bounds for the tree domatic number are given. Then, we establish a sharp lower bound for the number of edges in a connected graph of given order and given tree domatic number, and we characterize the extremal graphs. Finally, we show that a tree domatic number of a planar graph is at most 4 and give a characterization of planar graphs with the tree domatic number 3.