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

Network reliability and acyclic orientations

โœ Scribed by R. Johnson

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
934 KB
Volume
14
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A generalized chromatic polynomial, acyc
A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
โœ J. Rodriguez; A. Satyanarayana ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 753 KB

Suppose G =(V, E) is a graph and K, K', K" are subsets of V such that K sK'nK". We introduce and study a polynomial P(G, K, K', K"; I.) in i. This polynomial coincides with the classical chromatic polynomial P(G; 1) when K = V. The results of this paper generalize Whitney's characterizations of the

Children's network orientations
Children's network orientations
โœ Deborah Belle; Diana Dill; Robin Burr ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 692 KB
On Acyclic Orientations and Sequential D
On Acyclic Orientations and Sequential Dynamical Systems
โœ C.M. Reidys ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

We study a class of discrete dynamical systems that consists of the following data: (a) a finite (labeled) graph Y with vertex set 1 n , where each vertex has a binary state, (b) a vertex labeled multi-set of functions F i Y n 2 โ†’ n 2 i , and (c) a permutation ฯ€ โˆˆ S n . The function F i Y updates th