Largest and smallest minimal percolating sets in trees

zbMath1244.05062MaRDI QIDQ426841

Eric Riedl

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p64

zbMATH Keywords

percolationgraph theory

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Bootstrap percolation via automated conjecturing ⋮ Deterministic bootstrap percolation on trees ⋮ Maximal induced paths and minimal percolating sets in hypercubes ⋮ Neighborhood growth dynamics on the Hamming plane ⋮ Minimum degree conditions for small percolating sets in bootstrap percolation ⋮ The time of bootstrap percolation with dense initial sets ⋮ New ordering methods to construct contagious sets and induced degenerate subgraphs ⋮ Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach ⋮ Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs ⋮ Bootstrap Percolation on Degenerate Graphs ⋮ Maximal Spanning Time for Neighborhood Growth on the Hamming Plane

This page was built for publication: Largest and smallest minimal percolating sets in trees