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

The average number of cycles

โœ Scribed by W. Plesken; D. Robertz


Publisher
Springer
Year
2009
Tongue
English
Weight
129 KB
Volume
93
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the average rate of growth in sunspot
โœ Robert M. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Springer ๐ŸŒ English โš– 411 KB

The average rate of growth during the ascending portion of the sunspot cycle, defined here as the difference in smoothed sunspot number values between elapsed time (in months) t and sunspot minimum divided by t, is shown to correlate (r > 0.78) with the size of the sunspot cycle, especially for t >

Number of recurring cycles
โœ S. Parameswaran ๐Ÿ“‚ Article ๐Ÿ“… 1956 ๐Ÿ› Springer Vienna ๐ŸŒ English โš– 258 KB
On the average number ofk-sets
โœ Paul H. Edelman ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 223 KB
The average distance and the independenc
โœ F. R. K. Chung ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 258 KB

We prove that in every connected graph the independence number is at least as large as the average distance between vertices. Theorem. For every connected graph G , we have a ( G ) 2 D ( G ) , with equality if and only if G is a complete graph.