BROADER FAMILIES OF CORDIAL GRAPHS

Broader families of cordial graphs

A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and Flat Files the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1.In this paper Gift Sets we present general results involving the cordiality of graphs that resu

read more



Relationship between haemagglutination-inhibiting antibody titres and clinical protection against influenza: development and application of a bayesian random-effects model

Abstract Background Antibodies directed against haemagglutinin, measured by the haemagglutination inhibition (HI) assay are essential to protective immunity against influenza infection.An HI titre of 1:40 is generally accepted to correspond to a 50% reduction in the risk of contracting influenza in a susceptible population, but limited attempts hav

read more