Publication:4248175
From MaRDI portal
zbMath0924.05065MaRDI QIDQ4248175
Manoj K. Chari, Charles J. Colbourn
Publication date: 3 June 1999
05C99: Graph theory
Related Items
Unnamed Item, Information security: Designing a stochastic-network for throughput and reliability, On the structure of the \(h\)-vector of a paving matroid, A practical bounding algorithm for computing two-terminal reliability based on decomposition technique, Speeding up computation of the reliability polynomial coefficients for a random graph, A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges, \(g\)-elements of matroid complexes., The zero forcing polynomial of a graph, Practical sequential bounds for approximating two-terminal reliability, The chip-firing game