BACKGROUND Presentations to hospital with self-harm are common, associated with suicide and have an increased mortality, yet there is no accepted effective intervention. AIMS To investigate whether problem-solving therapy would improve outcomes in adults presenting to hospital with self-harm, compared with usual care. METHOD A Zelen randomised controlled trial was conducted in four district...

BACKGROUND Risk assessment forms a key component in self-harm management. Among self-harm presentations generally, lethality of an index act is a poor predictor of future non-fatal repetition. However, no study has examined whether severity of an index self-cutting episode is associated with prospective repetition. AIMS To examine factors associated with severity of self-cutting and in partic...

AIMS The significance of left ventricular hypertrophy in hypertension is well documented, being an independent risk factor for cardiovascular morbidity and mortality. Normal values for left ventricular mass and partition values for left ventricular hypertrophy come from measurements obtained by fundamental echocardiography. Secondary harmonic imaging improves definition of cardiac borders. We h...

Although a few studies investigated the impact of stock market fluctuations on population health, the question of whether stock market fluctuations have an impact on self-harm in children and adolescents remain unanswered. This study therefore investigated the association between stock market fluctuations and self-harm among children and adolescents in Hong Kong. Daily self-harm attendance reco...

The harmonic index of a graph G is defined as the sum of the weights 2 d(u) + d(v) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this work, we present the minimum and maximum values of the harmonic index for connected graphs with girth at least k (k ≥ 3), and characterize the corresponding extremal graphs. Using this result, we obtain several relations between the h...

The harmonic index of a graph G is defined as the sum of weights 2 d(u)+d(v) of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G, respectively. In this paper, we give a sharp lower bound on the harmonic index of trees with a perfect matching in terms of the number of vertices. A sharp lower bound on the harmonic index of trees with a given size of matching is ...

The harmonic index H(G) of a graph G is defined as the sum of weights 2 d(u) + d(v) of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this paper, we first present a sharp lower bound on the harmonic index of unicyclic conjugated graphs (unicyclic graphs with a perfect matching). Also a sharp lower bound on the harmonic index of unicyclic graphs is given in terms of the ...

The harmonic index ) (G H , of a graph G is defined as the sum of weights 1 )) deg( ) (deg( 2   v u of all edges in ) (G E , where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G as      ) ( 1 ) deg( ) deg( 2 ) , ( G E uv v u x x G H , where   1 0 ) ( ) , ( G H dx x G H . We present explicit formula for the values of harmonic polyn...