๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal consecutive-2 systems of lines and cycles

โœ Scribed by D. Z. Du; F. K. Hwang

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
355 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

A consecutive-2 system is a graph where each vertex can either work or fail and the system fails if and only if two vertices incident to the same edge both fail. The simplest probability structure attached to such systems is to assume that vertex i has probability p, of failing and the states of the vertices are stochastically independent. For a given graph G of n vertices and a given set P of n probabilities, an optimal consecutive-2 system is the triple ( G , P , M ) , where M is a mapping from P to the vertices of G such that the probability of the system failing is minimum. Consecutive-2 systems have been widely studied when the graph is either a line or a cycle. In this paper we study optimal consecutive-2 systems which consist of many lines or many cycles. Our results provide optimal mappings that depend only on the rankings of the individual failure probabilities and not on their actual values. Moreover, we show by examples that rankings alone are probably insufficient to solve cases more complex than those solved in this paper.

๐Ÿ“œ SIMILAR VOLUMES

Optimality of consecutive and nested tre
Optimality of consecutive and nested tree partitions
โœ Chang, G. J.; Hwang, F. K. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 84 KB

We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called cons

Optimal synthesis of refrigeration cycle
Optimal synthesis of refrigeration cycles and selection of refrigerants
โœ Shankar Vaidyaraman; Costas D. Maranas ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 273 KB

## Abstract The optimal synthesis of the refrigeration configuration and the selection of the best refrigerants that satisfy a set of process cooling duties at different temperatures is addressed. This approach simultaneously selects refrigerants and synthesizes refrigeration structures by minimizi

Cycle systems of the line graph of the c
Cycle systems of the line graph of the complete graph
โœ Cox, B.A.; Rodger, C.A. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 562 KB

For all m = 0 (mod 41, for all n = 0 or 2 (mod m), and for all n = 1 (mod 2m) w e find an m-cycle decomposition of the line graph of the complete graph K,. In particular, this solves the existence problem when m is a power of two.

Optimal arrangement of systems
Optimal arrangement of systems
โœ Philip J. Boland; Frank Proschan ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 354 KB

To location 15, we are to allocate a "generator" and n, "machines" for i = 1, . . . ,k, where n , 2 . . . 2 n,. Although the generators and machines function independently of one another, a machine is operable only if it and the generator at its location are functioning. The problem we consider is t

On optimal orientations of Cartesian pro
On optimal orientations of Cartesian products of even cycles and paths
โœ Koh, K. M.; Tay, E. G. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 122 KB

For a graph G , let D ( G ) be the family of strong orientations of G , and define d แŸ ( G ) ร… min{d(D)ร‰D โˆš D(G)}, where d(D) is the diameter of the digraph D. In this paper, we evaluate the values of d แŸ (C 2n 1