A study for quality evaluation of Taxilli Herba from different hosts based on fingerprint-activity relationship modeling and multivariate statistical analysis

In this study, a fingerprint-activity relationship modeling between chemical fingerprints and antirheumatic activity was established, and multivariate statistical analysis was used to evaluate the quality of Taxilli Herba (TH) from different hosts. Characteristic fingerprints of 20 batches of TH samples were generated by high-performance liquid chromatography coupled with triple quadrupole-time of flight tandem mass spectrometry (HPLC-Triple TOF-MS/MS), and the similarity analysis was calculated based on thirteen common characteristic peaks by hierarchical clustering analysis (HCA). Subsequently, nine efficacy markers were discovered by combining fingerprints and antirheumatic activity through grey correlation analysis (GCA) and bivariate correlation analysis (BCA). Meanwhile, the content of 5 constituents in 9 markers was determined by high-performance liquid chromatography coupled with triple quadrupole-linear ion trap tandem mass spectrometry (HPLC-QTRAP-MS/MS). The comprehensive quality of TH was assessed using multivariate statistical analysis, including principal components analysis (PCA) and technique for order preference by similarity to ideal solution (TOPSIS). The results showed that a high dose of TH extract could markedly ameliorate arthritis damage compared to other doses, with flavonoids playing an important role in the antirheumatic activity. The comprehensive quality of samples from Morus alba L. (SS) was superior to those from Liquidambar formosana Hance (FXS). The present study will demonstrate the markers associated with efficacy, and provide an applicable strategy for more comprehensive quality control and evaluation of TH.     

Photochemical degradation of hyaluronic acid by singlet oxygen

Changes of the rheological properties of hyaluronic acid (sodium-magnesium salt) solutions after exposure to UV radiation indicate a vigorous decrease in their viscosity, but its still strong shear rate dependence. Whereas the presence of the singlet oxygen sensitizer (anthracene-1-sulphonic acid) brings about a loss of shear dependence; the studied solutions show newtonian behavior.     

Graph theoretical procedure for obtaining analytical expressions of eigenspectra of linear chains and cycles with alternant vertex weights and same edge weight: Application to some complicated graphs

A graph theoretical procedure for obtaining eigenvalues of linear chains and cycles having alternant vertex weights (h₁, h₂, h₁, h₂, h₁, h₂, …) and the same edge weight (k) have been developed. The eigenvalues of some complicated graphs, such as graphs of linear polyacenes, methylene‐substituted linear polyacenes and cylindrical polyacene strips, stack graphs, and reciprocal graphs have been shown to be generated in closed analytical forms by this procedure. Many such graphs represent chemically important molecules or radicals. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005     

Improved square coloring of planar graphs

Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that $\frac{3}{2}\mathrm{\Delta }+1$ colors are sufficient to square color every planar graph of maximum degree Δ. This conjecture has been proven asymptotically for graphs with large maximum degree. We consider here planar graphs with small maximum degree and show that $2\mathrm{\Delta }+7$ colors are sufficient, which improves the best known bounds when $6?\mathrm{\Delta }?31$.     

The impact of loops on the game of cops and robbers on graphs

In the game of cops and robbers on graphs, the cops and the robber are allowed to pass their turn if they are located on a looped vertex. This paper explores the effect of loops on the cop number and the capture time. We provide examples of graphs where the cop number almost doubles when the loops are removed, graphs where the cop number decreases when the loops are removed, graphs where the capture time is quadratic in the number of vertices and copwin graphs where the cop needs to move away from the robber in optimal play.     

Vertex partitions of (C3,C4,C6)-free planar graphs

A graph is $(k_1,k_2)$-colorable if it admits a vertex partition into a graph with maximum degree at most $k_1$ and a graph with maximum degree at most $k_2$. We show that every $(C_3,C_4,C_6)$-free planar graph is $(0,6)$-colorable. We also show that deciding whether a $(C_3,C_4,C_6)$-free planar graph is $(0,3)$-colorable is NP-complete.