r 3: Resilient Random Regular Graphs

DOI10.1007/978-3-540-87779-0_10MaRDI QIDQ3540226zbMATH OpenOpenAlexFDO

Authors

Publication date 20 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87779-0_10

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Connectivity properties in random regular graphs with edge faults
• Connectivity of random regular graphs generated by the pegging algorithm
• Analysis of edge deletion processes on faulty random regular graphs.
• Expansion properties of a random regular graph after random vertex deletions
• The giant component threshold for random regular graphs with edge faults H. Prodinger

Cited in

(1)

• The question of the collapsibility of random 3-regular graphs

This page was built for publication: r 3: Resilient Random Regular Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540226)