SIAM Journal on Algebraic and Discrete Methods
Network reliability and algebraic structures
Network reliability and algebraic structures
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Combinatorial Enumeration
Expected value expansions in rooted graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Subgraph expansions are commonly used in the analysis of reliability measures of a failure-prone graph. We show that these expansions are special cases of a general result on the expected value of a random variable defined on a partially ordered set; when applied to random subgraphs, the general result defines a natural association between graph functions. As applications, we consider several graph invariants that measure the connectivity of a graph: the number of connected vertex sets of size k, the number of components of size k, and the total number of components. The expected values of these invariants on a random subgraph are global performance measures that generalize the ones commonly studied. Explicit results are obtained for trees, cycles, and complete graphs. Graphs which optimize these performance measures over a given class of graphs are studied