✦ LIBER ✦

Synthesis and Number of all Series-Parallel Structures with n Components

✍ Scribed by Schneeweiss, Winfrid G.; Heidtmann, Klaus D.

Book ID: 117934234
Publisher: IEEE
Year: 1980
Tongue: English
Weight: 829 KB
Volume: R-29
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.1980.5220851

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Synthesis and number of all series-paral

Synthesis and number of all series-parallel structures with n components: Winfrid G. Schneeweiss and Klaus D. Heidtmann. IEEE Trans. Reliab. R-29 (4), 315 (October 1980)

📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 115 KB

On asymptotic reliability functions of s

On asymptotic reliability functions of series-parallel and parallel-series systems with identical components

✍ Krzysztof Kołowrocki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Stochastic comparisons of series and par

Stochastic comparisons of series and parallel systems with randomized independent components

✍ Antonio Di Crescenzo; Franco Pellerey 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Reliability of All Possible Series-Paral

Reliability of All Possible Series-Parallel Redundant Structures of M I.I.D. Units with Two Failure Modes

✍ Nakagawa, Yuji; Hattori, Yoshio 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 717 KB

Comparisons of series and parallel syste

Comparisons of series and parallel systems with components sharing the same copula

✍ Jorge Navarro; Fabio Spizzichino 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

## Abstract The paper is devoted to study stochastic comparisons of series and parallel systems with vectors of component lifetimes sharing the same copula. We show that, under some conditions on the common copula, the series system with heterogeneous components is worse than the series system with

The circular chromatic number of series-

The circular chromatic number of series-parallel graphs with large girth

✍ Chien, Chihyun; Zhu, Xuding 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 2 views

It was proved by Hell and Zhu that, if G is a series-parallel graph of girth at least 2 (3k -1)/2 , then χ c (G) ≤ 4k/(2k -1). In this article, we prove that the girth requirement is sharp, i.e., for any k ≥ 2, there is a series-parallel graph G of girth 2 (3k -1)/2 -1 such that χ c (G) > 4k/(2k -1)