Strict Majority Bootstrap Percolation in the r-wheel

•We study the strict majority bootstrap percolation process on graphs.•This is a natural model of information dissemination.•pc is the minimal proportion of randomly chosen vertices that percolates the graph.•Our goal is to find network topologies for which pc is as small as possible.•We prove that, for the class of r-wheels, pc tends to 14 as r→∞.