✦ LIBER ✦

On regular splittings and graph compatible splittings of an M-matrix

✍ Scribed by Wen Li

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 584 KB
Volume: 177
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90324-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On regular splittings of an M-matrix

✍ Wen Li 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 709 KB

On graph compatible Splittings of M-matr

On graph compatible Splittings of M-matrices

✍ Mou-Cheng Zhang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The relationship of a regular splitting

The relationship of a regular splitting to a graph compatible splitting

✍ Wen Li 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 230 KB

M-Matrix Flux Splitting for General Full

M-Matrix Flux Splitting for General Full Tensor Discretization Operators on Structured and Unstructured Grids

✍ Michael G. Edwards 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 382 KB

Diagonal tensor flux approximations are commonly used in fluid dynamics. This approximation introduces an O(1) error in flux whenever the coordinate system is nonaligned with the principal axes of the tensor which is particularly common when employing curvilinear gridding. In general a consistent fu

Singular graph and extension of jordan c

Singular graph and extension of jordan chains of an M-Matrix

✍ Rafael Cantó; Joan-Josep Climent 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 908 KB

On the chromatic number of a random 5-re

On the chromatic number of a random 5-regular graph

✍ J. Díaz; A. C. Kaporis; G. D. Kemkes; L. M. Kirousis; X. Pérez; N. Wormald 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract It was only recently shown by Shi and Wormald, using the differential equation method to analyze an appropriate algorithm, that a random 5‐regular graph asymptotically almost surely has chromatic number at most 4. Here, we show that the chromatic number of a random 5‐regular graph is as