The toughness of a graph G, t (G), is defined as t (G) = min{|S|/ (G âˆ’ S)|S âŠ† V (G), (G âˆ’ S) > 1} where (G âˆ’ S) denotes the number of components of G âˆ’ S or t (G) = +âˆž if G is a complete graph. Muchâ€¦ (More)

In this paper a characterization of maximum fractional (g, f )-factors of a graph is presented. The properties of the maximum fractional (g, f )-factors and fractional (g, f )-factors with theâ€¦ (More)

We prove that fractional k-factors can be transformed among themselves by using a new adjusting operation repeatedly. We introduce, analogous to Bergeâ€™s augmenting path method in matching theory, theâ€¦ (More)

A weighted least squares statistic is commonly used to test homogeneity of the risk difference for a series of 2 x 2 tables. Since the method is based on asymptotic theory, its type I error rate isâ€¦ (More)

The problem of deriving an upper tolerance limit for a ratio of two normally distributed random variables is addressed, when the random variables follow a bivariate normal distribution, or when theyâ€¦ (More)