scientific article; zbMATH DE number 1295362
From MaRDI portal
Publication:4248175
Cited in
(16)- g-elements of matroid complexes.
- The zero forcing polynomial of a graph
- Practical sequential bounds for approximating two-terminal reliability
- On the roots of all-terminal reliability polynomials
- The chip-firing game
- scientific article; zbMATH DE number 5944468 (Why is no real title available?)
- scientific article; zbMATH DE number 3947973 (Why is no real title available?)
- scientific article; zbMATH DE number 4053686 (Why is no real title available?)
- On the structure of the \(h\)-vector of a paving matroid
- Geometric properties of reliability polynomials
- scientific article; zbMATH DE number 7583268 (Why is no real title available?)
- Information security: Designing a stochastic-network for throughput and reliability
- 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
- Network robustness based on inverse percolation
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248175)
