Network transformations and bounding network reliability
From MaRDI portal
Publication:5285474
Recommendations
Cites work
Cited in
(25)- Undirected simple connected graphs with minimum number of spanning trees
- Chip firing and all-terminal network reliability bounds
- On a conjecture of V. Nikiforov
- Condensation of a 3-terminal subnetwork into a delta in probabilistic networks
- Graph vulnerability parameters, compression, and quasi-threshold graphs
- Non-Stanley bounds for network reliability
- Reliability covering problems for hypergraphs
- Graph vulnerability parameters, compression, and threshold graphs
- Each (n,m)-graph having the i-th minimal Laplacian coefficient is a threshold graph
- Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs
- A novel algorithm on network reliability estimation
- On family of graphs with minimum number of spanning trees
- Extremal graphs for the Tutte polynomial
- The Wheatstone Bridge Reduction in Network Reliability Computations
- Network reliability and acyclic orientations
- scientific article; zbMATH DE number 3939394 (Why is no real title available?)
- Reliability-constrained dimensioning of transmission resources in packet-switched networks
- A reliability-improving graph transformation with applications to network reliability
- scientific article; zbMATH DE number 176253 (Why is no real title available?)
- On a poset of trees
- Chordal 2-connected graphs and spanning trees
- Uniformly optimally reliable graphs: A survey
- Network reliability: Heading out on the highway
- Maximum number of spanning trees and connectivity: graphs with a fixed minimum degree and bipartite graphs
- On topological indices, graph compression, and threshold graphs
This page was built for publication: Network transformations and bounding network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285474)
