Let G = (V, E), V {v1, v2,..., vn}, be a simple graph without isolated vertices, with the sequence of vertex degrees d1 ? d2 ?...? dn > 0, di d(vi). If vertices vi and vj are adjacent in G, we write i ~ j, otherwise ~/ j. The inverse degree topological index is defined to ID(G) ?ni=1 1/di i~j (1/d2i + 1/d2j), coindex ?ID(G) i~/j(1/d2i 1/d2j). We obtain number inequalities which determine bou...

OBJECTIVE The visceral sensitivity index (VSI) is a useful self-report measure of the gastrointestinal symptom-specific anxiety (GSA) of patients with irritable bowel syndrome (IBS). Previous research has shown that worsening GSA in IBS patients is related to the severity of GI symptoms, suggesting that GSA is an important endpoint for intervention. However, there is currently no Japanese versi...

n engl j med 359;4 www.nejm.org july 24, 2008 431 Pavlin JD, Souter KJ, Hong JY, Freund PR, Bowdle TA, Bower 1. JO. Effects of bispectral index monitoring on recovery from surgical anesthesia in 1,580 inpatients from an academic medical center. Anesthesiology 2005;102:566-73. Lindholm ML, Brudin L, Sandin RH. Bispectral index moni2. toring: appreciated but does not affect drug dosing and hypnot...

A connected pseudocomplete n-coloring of a graph G is a (non-proper) n-coloring of the vertices of G such that each color class induces a connected subgraph and for each pair of color classes there is an edge with one end of each color; this can be viewed as a kind of “inverse image” of a clique minor. The connected pseudoachromatic index of a graph G is the largest n for which the line graph o...

Potential functional consequences of the differences in protein distribution between the mitochondria of the rat liver, heart, brain, and kidney, as determined in the companion paper in this issue (Johnson DT, French S, Blair PV, You JS, Bemis KG, Wang M, Harris RA, and Balaban RS. The tissue heterogeneity of the mammalian mitochondrial proteome. Am J Physiol Cell Physiol292: C689-C697, 2006), ...

Let G be a graph with vertex set V(G) and edge set E(G), and let A be an abelian group. A labeling f : V(G) ....... A induces a edge labeling r : E{G) ....... A defined by r(xy) = f(x) + f(y) for each xy E E. For each i E A, let vJ(i) card{v E V(G) : f(v) i} and eJ(i) card{e E E(G) : r(e) i}. Let c(J) {leJ(i) eJ(j)1 : = = (i,j) E A x A}. A labeling f of a graph G is said to be A-friendly if IVJ...

This work is aimed at describing the workflow for a methodology that combines chemoinformatics and pharmacoepidemiology methods and at reporting the first predictive model developed with this methodology. The new model is able to predict complex networks of AIDS prevalence in the US counties, taking into consideration the social determinants and activity/structure of anti-HIV drugs in preclinic...

A new topological index J (based on distance sums s i as graph invariants) is proposed. For unsaturated or aromatic compounds, fractional bond orders are used in calculating s i. The degeneracy of J is lowest among all single topological indices described so far. The asymptotic behaviour of J is discussed, e.g. when n ~ ~ in CnH2n+2, J ~ ~r for linear alkanes, and J ~ ** for highly branched ones.