Common multiples of complete graphs and a 4-cycle

A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

Decompositions of complete graphs into triangles and Hamilton cycles

For all odd integers n greater than or equal to 1, let G(n) denote the complete graph of order n, and for all even integers n greater than or equal to 2 let G,, denote the complete graph of order n with the edges of a 1-factor removed. It is shown that for all non-negative integers h and t and all positive integers n, G, can be decomposed into h Hamilton cycles and t triangles if and only if nh + 3t is the number of edges in G(n). (C) 2004 Wiley Periodicals, Inc.

Temporal aspects of the VO2 response at the power output associated with VO2peak in well trained cyclists: Implications for interval training prescription

The power output achieved at peak oxygen consumption (VO2 peak) and the time this power can be maintained (i.e., Tmax) have been used in prescribing high-intensity interval training. In this context, the present study examined temporal aspects of the VO2 response to exercise at the cycling power that output well trained cyclists achieve their VO2 peak (i.e., Pmax). Following a progressive exercise test to determine VO2 peak, 43 well trained male cyclists (M age = 25 years, SD = 6; M mass = 75 kg SD = 7; M VO2 peak = 64.8 ml(.)kg(1.)min(-1), SD = 5.2) performed two Tmax tests 1 week apart.1. Values expressed for each participant are means and standard deviations of these two tests. Participants achieved a mean VO2 peak during the Tmax test after 176 s (SD = 40; = 74% of Tmax, SD = 12) and maintained it for 66 s (SD = 39; M = 26% of Tmax, SD = 12). Additionally they obtained mean 95 % of VO2 peak after 147 s (SD = 31; M = 62 % of Tmax, SD = 8) and maintained it for 95 s (SD = 38; M = 38 % of Tmax, SD = 8). These results suggest that 60-70% of Tmax is an appropriate exercise duration for a population of well trained cyclists to attain VO2 peak during exercise at Pmax. However due to intraparticipant variability in the temporal aspects of the VO2 response to exercise at Pmax, future research is needed to examine whether individual high-intensity interval training programs for well trained endurance athletes might best be prescribed according to an athlete's individual VO2 response to exercise at Pmax.

Steiner trade spectra of complete partite graphs

The Steiner trade spectrum of a simple graph G is the set of all integers t for which there is a simple graph H whose edges can be partitioned into t copies of G in two entirely different ways. The Steiner trade spectra of complete partite graphs were determined in all but a few cases in a recent paper by Billington and Hoffman (Discrete Math. 250 (2002) 23). In this paper we resolve the remaining cases. (C) 2004 Elsevier B.V. All rights reserved.

Some equitably 3-colourable cycle decompositions of complete equipartite graphs

Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),.. , c(k). If an m-cycle C in G has n(i) vertices coloured c(i), i = 1, 2,..., k, and vertical bar n(i) - n(j)vertical bar <= 1 for any i, j is an element of {1, 2,..., k}, then C is said to be equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in W is equitably k-coloured. For m = 3, 4 and 5 we completely settle the existence question for equitably 3-colourable m-cycle decompositions of complete equipartite graphs. (c) 2005 Elsevier B.V. All rights reserved.

A note on bifurcation from an interval

We study the global bifurcation of nonlinear Sturm-Liouville problems of the form -(pu')' + qu = lambda a(x)f(u), b(0)u(0) - c(0)u' (0) = 0, b(1)u(1) + c(1)u'(1) = 0 which are not linearizable in any neighborhood of the origin. (c) 2005 Published by Elsevier Ltd.

Packing lambda-fold complete multipartite graphs with 4-cycles

A maximum packing of any lambda-fold complete multipartite graph (where there are lambda edges between any two vertices in different parts) with edge-disjoint 4- cycles is obtained and the size of each minimum leave is given. Moreover, when lambda =2, maximum 4-cycle packings are found for all possible leaves.

Pharmacokinetic-pharmacodynamic modelling of QT interval prolongation following citalopram overdoses

Aims To develop a pharmacokinetic-pharmacodynamic model describing the time-course of QT interval prolongation after citalopram overdose and to evaluate the effect of charcoal on the relative risk of developing abnormal QT and heart-rate combinations. Methods Plasma concentrations and electrocardiograph (ECG) data from 52 patients after 62 citalopram overdose events were analysed in WinBUGS using a Bayesian approach. The reported doses ranged from 20 to 1700 mg and on 17 of the events a single dose of activated charcoal was administered. The developed pharmacokinetic-pharmacodynamic model was used for predicting the probability of having abnormal combinations of QT-RR, which was assumed to be related to an increased risk for torsade de pointes (TdP). Results The absolute QT interval was related to the observed heart rate with an estimated individual heart-rate correction factor [alpha = 0.36, between-subject coefficient of variation (CV) = 29%]. The heart-rate corrected QT interval was linearly dependent on the predicted citalopram concentration (slope = 40 ms l mg(-1), between-subject CV = 70%) in a hypothetical effect-compartment (half-life of effect-delay = 1.4 h). The heart-rate corrected QT was predicted to be higher in women than in men and to increase with age. Administration of activated charcoal resulted in a pronounced reduction of the QT prolongation and was shown to reduce the risk of having abnormal combinations of QT-RR by approximately 60% for citalopram doses above 600 mg. Conclusion Citalopram caused a delayed lengthening of the QT interval. Administration of activated charcoal was shown to reduce the risk that the QT interval exceeds a previously defined threshold and therefore is expected to reduce the risk of TdP.

Decomposition of complete graphs into 5-cubes

Necessary conditions for the complete graph on n vertices to have a decomposition into 5-cubes are that 5 divides it - 1 and 80 divides it (it - 1)/2. These are known to be sufficient when n is odd. We prove them also sufficient for it even, thus completing the spectrum problem for the 5-cube and lending further weight to a long-standing conjecture of Kotzig. (c) 2005 Wiley Periodicals, Inc.

Sigmoidal cosine series on the interval

We construct a set of functions, say, psi([r])(n) composed of a cosine function and a sigmoidal transformation gamma(r) of order r > 0. The present functions are orthonormal with respect to a proper weight function on the interval [-1, 1]. It is proven that if a function f is continuous and piecewise smooth on [-1, 1] then its series expansion based on psi([r])(n) converges uniformly to f so long as the order of the sigmoidal transformation employed is 0 < r