๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graphs of cumulative residuals

โœ Scribed by E. B. Kraus

Publisher
John Wiley and Sons
Year
1956
Tongue
English
Weight
180 KB
Volume
82
Category
Article
ISSN
0035-9009

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

The particular uses of cumulative residuals are demonstrated by two plots of annual Nile discharge at Aswan. It is shown that the mean regime of the Nile changed abruptly in 1898 in conformance with secular rainfall changes throughout most of the tropics. No trend is apparent in the two periods before and after 1898.

๐Ÿ“œ SIMILAR VOLUMES

Graph theoretical elaboration of cumulat
Graph theoretical elaboration of cumulative scaling techniques
โœ Frans N. Stokman ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 690 KB

In this paper a graph theoretical elaboration of the stochastic cumulative scaling model of Mokken (1970) is given to determine: (a) cumulative scales of vertices on the basis of their relations with other vertices in a simple graph; and (b) cumulative scales of relations in a multigraph. In Stokma

On the residue of a graph
On the residue of a graph
โœ O. Favaron; M. Mahรฉo; J.-F. Saclรฉ ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 915 KB

## Abstract The residue __R__ of a simple graph __G__ of degree sequence __S__: __d__~1~ โฉพ __d__~2~ โฉพ โ€ฆ๏ธ โฉพ __d__~__n__~ is the number of zeros obtained by the iterative process consisting of deleting the first term __d__~1~ of __S__, subtracting 1 from the __d__~1~ following ones, and sorting down

On residually finite graph products
On residually finite graph products
โœ M. Shirvani ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB
k-Independence and thek-residue of a gra
k-Independence and thek-residue of a graph
โœ Jelen, Frank ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 282 KB ๐Ÿ‘ 2 views

Favaron, Mahรฉo, and Saclรฉ proved that the residue of a simple graph G is a lower bound on its independence number ฮฑ(G). For k โˆˆ N, a vertex set X in a graph is called k-independent, if the subgraph induced by X has maximum degree less than k. We prove that a generalization of the residue, the k-resi