Expander properties in random regular graphs with edge faults

DOI10.1007/3-540-59042-0_93zbMATHOpenAlexMaRDI QIDQ4596641FDO

Authors Sotiris E. Nikoletseas, P. G. Spirakis

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_93

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Random regular graphs with edge faults: Expansion through cores
• Expansion properties of a random regular graph after random vertex deletions
• Analysis of edge deletion processes on faulty random regular graphs.
• The giant component threshold for random regular graphs with edge faults H. Prodinger
• scientific article; zbMATH DE number 1361486

Cited in

(13)

• Vertex percolation on expander graphs
• Random regular graphs with edge faults: Expansion through cores
• Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
• Analysis of edge deletion processes on faulty random regular graphs.
• Expander properties and the cover time of random intersection graphs
• Large independent sets in general random intersection graphs
• The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
• The effect of faults on network expansion
• The giant component threshold for random regular graphs with edge faults H. Prodinger
• Interval routing in reliability networks
• Connectivity properties in random regular graphs with edge faults
• scientific article; zbMATH DE number 1361486 (Why is no real title available?)
• Expansion properties of a random regular graph after random vertex deletions

This page was built for publication: Expander 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 Q4596641)