✦ LIBER ✦

On a distribution of weather cycles by length

✍ Scribed by K. R. Gabriel; J. Neumann

Publisher: John Wiley and Sons
Year: 1957
Tongue: English
Weight: 371 KB
Volume: 83
Category: Article
ISSN: 0035-9009
DOI: 10.1002/qj.49708335714

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In the paper a weather cycle is defined as the combination of a wet (dry) spell with the successive dry (wet) spell. On the assumption that the lengths of wet and dry spells are independent and obey geometric distributions, the distribution function of the lengths of weather cycles is deduced and tested against observational data for Tel Aviv. The peak frequency of weather‐cycle lengths at Tel Aviv is found to be at about 4 days.

📜 SIMILAR VOLUMES

On the distribution of cycle lengths in

On the distribution of cycle lengths in graphs

✍ A. Gyárfás; J. Komlós; E. Szemerédi 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 843 KB

The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdos and Hajnal stating that for suit

Distribution of Cycle Lengths in Graphs

✍ Genghua Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Bondy and Vince proved that every graph with minimum degree at least three contains two cycles whose lengths differ by one or two, which answers a question raised by Erdo ˝s. By a different approach, we show in this paper that if G is a graph with minimum degree d(G) \ 3k for any positive integer k,

Weather and cycling—a first approach to

Weather and cycling—a first approach to the effects of weather conditions on cycling

✍ Christiane Brandenburg; Andreas Matzarakis; Arne Arnberger 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract In urban and suburban recreation areas, walking and cycling constitute an important part of leisure activities. Both activities involving motion, are not only carried out for recreation but also for commuting to and from work. The mixture of recreation and commuting cycling is a challen

Covering the vertices of a graph by cycl

Covering the vertices of a graph by cycles of prescribed length

✍ D. Amar; I. Fournier; A. Germa 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe

Covering the vertices of a digraph by cy

Covering the vertices of a digraph by cycles of prescribed length

✍ D. Amar; A. Raspaud 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 427 KB

the vertices of a digraph by cycles of prescribed length, Discrete Mathematics 87 (

On relative length of longest paths and

On relative length of longest paths and cycles

✍ Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract For a graph __G__, __p__(__G__) and __c__(__G__) denote the order of a longest path and a longest cycle of __G__, respectively. In this paper, we prove that if __G__ is a 3 ‐connected graph of order __n__ such that the minimum degree sum of four independent vertices is at least __n__+ 6