Connectivity properties in random regular graphs with edge faults
From MaRDI portal
Recommendations
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- The giant component threshold for random regular graphs with edge faults
- Analysis of edge deletion processes on faulty random regular graphs
- Analysis of edge deletion processes on faulty random regular graphs.
- Expander properties in random regular graphs with edge faults
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Graphs as models of communication network vulnerability: Connectivity and persistence
- Network Flow and Testing Graph Connectivity
- The asymptotic distribution of short cycles in random regular graphs
Cited in
(12)- Analysis of edge deletion processes on faulty random regular graphs.
- Interval routing in reliability networks
- On the robustness of interconnections in random graphs: a symbolic approach.
- The diameter and connectivity of networks with random dependent faults
- r 3: Resilient Random Regular Graphs
- Trade-offs between density and robustness in random interconnection graphs
- Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing
- The giant component threshold for random regular graphs with edge faults
- Hamiltonicity of the torus network under the conditional fault model
- The giant component threshold for random regular graphs with edge faults H. Prodinger
- Random regular graphs with edge faults: Expansion through cores
- Expansion properties of a random regular graph after random vertex deletions
This page was built for publication: Connectivity properties in random regular graphs with edge faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249039)