Random regular graphs with edge faults: Expansion through cores

DOI10.1016/S0304-3975(00)00215-2zbMath0972.68009MaRDI QIDQ5941563

Andreas Goerdt

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

communication networkfaulty random regular graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

The mixing time of the giant component of a random graph ⋮ Analysis of edge deletion processes on faulty random regular graphs. ⋮ Expansion properties of a random regular graph after random vertex deletions

Cites Work

• The isoperimetric number of random regular graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• On the fault tolerance of the butterfly
• Efficient self-embedding of butterfly networks with random faults
• Expander properties in random regular graphs with edge faults
• Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random regular graphs with edge faults: Expansion through cores