Connectivity properties in random regular graphs with edge faults

DOI10.1142/S0129054100000156MaRDI QIDQ5249039zbMATH OpenFDO

Authors Krishna Palem, Sotiris E. Nikoletseas, P. G. Spirakis, Moti Yung

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054100000156

zbMATH Keywords

giant connected componentgraph connectivityrandom graphsreliable network computing

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The giant component threshold for random regular graphs with edge faults H. Prodinger
• scientific article; zbMATH DE number 1361486
• Publication:4508361
• 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
• scientific article; zbMATH DE number 1759469 (Why is no real title available?)
• Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing
• scientific article; zbMATH DE number 1361486 (Why is no real title available?)
• 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)