A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications
From MaRDI portal
Publication:1720743
DOI10.1155/2018/3131087zbMath1427.05152OpenAlexW2897272971MaRDI QIDQ1720743
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/3131087
Cites Work
- Unnamed Item
- Bounds on the number of edges in hypertrees
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
- Maximally edge-connected hypergraphs
- Spanning trees of 3-uniform hypergraphs
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- An upper bound on the sum of squares of degrees in a hypergraph
- An upper bound on the sum of squares of degrees in a graph
- Hypertrees
- Hypergraph theory. An introduction
- Cyclic partitions of complete uniform hypergraphs
- Cascading failures of \(k\) uniform hyper-network based on the hyper adjacent matrix
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
- Brand effect versus competitiveness in hypernetworks
- A survey of some network reliability analysis and synthesis results
- HYPERSTRUCTURES, A NEW APPROACH TO COMPLEX SYSTEMS
- Computational Complexity of Network Reliability Analysis: An Overview
- Synthesis of reliable networks - a survey
- An algorithm for reliability analysis of planar graphs
- Hypergraph Theory in Wireless Communication Networks
- Random Graphs
