Expander properties in random regular graphs with edge faults

DOI10.1007/3-540-59042-0_93zbMath1379.68259OpenAlexW1567122189MaRDI QIDQ4596641

Sotiris E. Nikoletseas, Paul 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)

Related Items (7)

Analysis of edge deletion processes on faulty random regular graphs. ⋮ The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Large independent sets in general random intersection graphs ⋮ Interval routing in reliability networks ⋮ Random regular graphs with edge faults: Expansion through cores ⋮ Expander properties and the cover time of random intersection graphs

This page was built for publication: Expander properties in random regular graphs with edge faults