We are interested in a function f(p) that represents the probability that a random subset of edges of a-regular graph G contains half the edges of some cycle of G. f(p) is also the probability that a codeword be corrupted beyond recognition when words of the cycle code of G are submitted to the binary symmetric channel. We derive a precise upperbound on the largest p for which f(p) can vanish w...

The continuous flow of carbon from the land and water through the atmosphere and living organisms makes up the global carbon cycle [1]. It contains reservoirs where carbon is stored and features dynamic flows of carbon between the carbon pools [2]. Forests are one of the largest reservoirs of carbon on Earth [1], and therefore their storage and release of carbon have a great impact on the globa...

In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heuristic. Our improvement is based on replacing the selection of each path to be contracted after deleting a heaviest arc from each short cycle in an Optimal Assignment Problem Solution (OAPS) by contracting a single ar...

Globally, the seasonal cycle is the largest single component of observed sea surface temperature (SST) variability, yet it is still not fully understood. Herein, the degree to which the structure of the seasonal cycle of Southern Hemisphere SST can be explained by the present understanding of surface fluxes and upper-ocean physics is examined. It has long been known that the annual range of Sou...

Let T be a tree with at least four vertices, none of which has degree 2, embedded in the plane. A Halin graph is a plane graph constructed by connecting the leaves of T into a cycle. Thus the cycle C forms the outer face of the Halin graph, with the tree inside it. Let G be a Halin graph with order n. Denote by [Formula: see text] the Laplacian spectral radius of G. This paper determines all th...

For a class C of binary linear codes, we write θC : (0, 1) → [0, 12 ] for the maximum-likelihood decoding threshold function of C, the function whose value at R ∈ (0, 1) is the largest bit-error rate p that codes in C can tolerate with a negligible probability of maximum-likelihood decoding error across a binary symmetric channel. We show that, if C is the class of cycle codes of graphs, then θ...

The celebrated result of Fleischner states that the square of every 2-connected graph is Hamiltonian. We investigate what happens if the graph is just connected. For every n ≥ 3, we determine the smallest length c(n) of a longest cycle in the square of a connected graph of order n and show that c(n) is a logarithmic function in n. Furthermore, for every c ≥ 3, we characterize the connected grap...

The surface heat budget in the equatorial Pacific Ocean was investigated through ocean model simulations, both the climatological cycle and the case of the 1994–95 warm event. The dominant processes governing the seasonal cycle of sea surface temperature (SST) vary significantly across the basin. In the western Pacific the annual cycle of SST is primarily in response to net surface heat flux. I...

We have recently shown that nasal immunization of anesthetized mice with human papillomavirus type 16 (HPV16) virus-like particles (VLPs) is highly effective at inducing both neutralizing immunoglobulin A (IgA) and IgG in genital secretions, while parenteral immunization induced only neutralizing IgG. Our data also demonstrated that both isotypes are similarly neutralizing according to an in vi...