Strict majority bootstrap percolation in the \textit{r}-wheel

DOI10.1016/j.ipl.2014.01.005zbMath1284.68467arXiv1308.3831OpenAlexW2069174998MaRDI QIDQ2446567

Yanyan Li

Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.3831

zbMATH Keywords

interconnection networksbootstrap percolation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Strong-majority bootstrap percolation on regular graphs with low dissemination threshold ⋮ Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results

Cites Work

• On dissemination thresholds in regular and irregular graph classes
• On the enumeration and generation of generalized Dyck words
• Bootstrap percolation on the random regular graph
• Majority Bootstrap Percolation on the Hypercube
• The sharp threshold for bootstrap percolation in all dimensions

This page was built for publication: Strict majority bootstrap percolation in the \textit{r}-wheel