✦ LIBER ✦

On the gradient of zodiacal light with heliocentric distance

✍ Scribed by R. Dumont

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 103 KB
Volume: 23
Category: Article
ISSN: 0032-0633
DOI: 10.1016/0032-0633(75)90172-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the brightness variations of comet Ha

On the brightness variations of comet Halley at large heliocentric distances

✍ K. R. Flammer; B. Jackson; D. A. Mendis 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 525 KB

On the possibility of detecting solar fl

On the possibility of detecting solar flare effects in the zodiacal light

✍ N.Y. Misconi; M.S. Hanner 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 593 KB

On the equivalence of expressions for in

On the equivalence of expressions for inverting the 3-dimensional zodiacal light brightness integral

✍ Donald W. Schuerman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 189 KB

The investigations of ‘zodiacal light’ o

The investigations of ‘zodiacal light’ of isolated AE-Herbig stars with non-periodic Algol-type minima

✍ V. P. Grinin; N. N. Kiselev; N. Kh. Minikulov; G. P. Chernova; N. V. Voshchinnik 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 695 KB

On the Non - Existence of Perfect Codes

On the Non - Existence of Perfect Codes with Rank Distance

✍ Kefei Chen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB

Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. We know that the existence of perfect codes is an interesting topic in coding theory; as a new type of codes, we consider the existence

On the average Steiner distance of graph

On the average Steiner distance of graphs with prescribed properties

✍ Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 703 KB

The average n-distance of a connected graph G, p,,(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on pn for two-connected graphs and for k-chromatic graphs. Moreover, we show that pn(G) does not depend on the n-diameter of G.