𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on Solar Cycle Length Estimates

✍ Scribed by J. M. Vaquero; J. A. García; M. C. Gallego

Publisher
Springer
Year
2006
Tongue
English
Weight
157 KB
Volume
235
Category
Article
ISSN
0038-0938

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Cycle Lengths in Graphs
A Note on Cycle Lengths in Graphs
✍ R.J. Gould; P.E. Haxell; A.D. Scott 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 121 KB
Note on graphs without repeated cycle le
Note on graphs without repeated cycle lengths
✍ Chen, Guantao; Lehel, Jen�; Jacobson, Michael S.; Shreve, Warren E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

In this note we prove that every 2-connected graph of order n with no repeated cycle lengths has at most n + 2(n -2) -1 edges and we show this result is best possible with the correct order of magnitude on √ n. The 2connected case is also used to give a quick proof of Lai's result on the general cas

A note on minimum distance estimates
A note on minimum distance estimates
✍ Constantine A. Drossos; Andreas N. Philippou 📂 Article 📅 1980 🏛 Springer Japan 🌐 English ⚖ 110 KB
Solar cycle length hypothesis appears to
Solar cycle length hypothesis appears to support the ipcc on global warming
✍ P. Laut; J. Gundermann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 421 KB

Since the discovery of a striking correlation between 0!1!1!1!0 \_ltered solar cycle lengths and the 00!year running average of northern hemisphere land air temperatures\ there have been widespread speculations as to whether these \_ndings would rule out any signi\_cant contributions to global warmi

A note on a cycle partition problem
A note on a cycle partition problem
✍ Fengli Yang; Elkin Vumar 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Let G be any graph, and let c(G) denote the circumference of G. If, for every pair c 1 , c 2 of positive integers satisfying c 1 + c 2 = c(G), the vertex set of G admits a partition into two sets V 1 and V 2 such that V i induces a graph of circumference at most c i , i = 1, 2, then G is said to be