✦ LIBER ✦

Regular mixtures

✍ Scribed by Erik Högfeldt

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 156 KB
Volume: 289
Category: Article
ISSN: 0003-2670
DOI: 10.1016/0003-2670(94)80110-x

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that Guggenheim's zeroth approximation is consistent with two kinds of solutions, one where the characteristic parameter b is independent of temperature and one dependent of temperature. The first case has tacitly been assumed to be the only one. The second one is new and is here illustrated by data on the liquid ion exchanger dinonylnaphthalene sulfonic acid.

📜 SIMILAR VOLUMES

Regularized mixture discriminant analysi

Regularized mixture discriminant analysis

✍ Zohar Halbe; Mayer Aladjem 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 335 KB

Thermodynamics of nematic liquid crystal

Thermodynamics of nematic liquid crystalline mixtures. A regular solution approximation

✍ Roger Chang 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Vapour-Liquid Equilibrium in Binary Aque

Vapour-Liquid Equilibrium in Binary Aqueous Mixtures using a Modified Regular Solution Model

✍ V. H. Alvarez; C. A. Faúndez; J. O. Valderrama 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a

Regular Homomorphisms and Regular Maps

✍ Aleksander Malnič; Roman Nedela; Martin Škoviera 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 123 KB

Regular homomorphisms of oriented maps essentially arise from a factorization by a subgroup of automorphisms. This kind of map homomorphism is studied in detail, and generalized to the case when the induced homomorphism of the underlying graphs is not valency preserving. Reconstruction is treated by

Regular factors in regular graphs

✍ P. Katerinis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.