Let G be a random graph with n labelled vertices in which the edges are chosen independently with a fixed probability p, 0 < p < 1. In this note we prove that, with the probability tending to 1 as n -+ 00, the binding number of a random graph G satisfies: (i) b(G) = (n l)/(n 8), where 8 is the minimal degree of G; (ii) l/q E < b(G) < l/q, where E is any fixed positive number and q = 1 p; (iii) ...

We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b > 0. Our conditions are best possible in exactly the same way that Chvátal’s well-known degree condition to guarantee a graph is hamiltonian is best possible.

The interaction between isatin-β-thiosemicarbazone (IBT) and calf thymus DNA (CT-DNA) was investigated in physiological buffer (pH 7.4) using Neutral Red (NR) dye as a spectral probe by UV–Vis absorption and fluorescence spectroscopy, as well as viscosity measurements. The IBT is stabilized by intercalation in the DNA ( K [IBT –DNA] =1.03×105 M−1), and displaces the NR dye from the NR–DNA comple...

the surface parameter of nanoparticles such as hydrophobicity and a hydrophilicity on protein structure and function is very important. in this study, conformational changes of glucose oxidase (gox) in the mercaptopurine: gnps and 11-mercaptoundecanoic acid: gnps as a hydrophobic and a hydrophilic gnps surface was investigated by various spectroscopic techniques, including: uv-vis absorption, f...