It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ^ n, then G is the union of edge-disjoint 1-factors. It is well known that this conjecture is true for d(G) equal to 2n —1 or 2n — 2. We show here that it is true for d(G) equal to2n — 3, In — 4, or2n — 5. We also show that it is true for </(G)>$|K(G)|.
In this paper we present a new approach to the formal specification of distributed real-time systems using the formal description technique LOTOS together with a real-time temporal logic SQTL. This approach characterized by a separation of concerns, aims to construct abstractly a model from the a functional specification according to real-time constraints.… (More)
Inhibition is a central construct to the frontal lobe theory of ageing, yet its construct validity remains unproven. Furthermore, age effects on measures of inhibition are often reported without adequate control for the effects of global slowing on performance. We investigated inhibitory function in older adults in two experiments. In Experiment 1, 49… (More)