Document Type
Article
Publication Date
1-1-2021
Journal / Book Title
Journal of Combinatorics
Abstract
The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become coloured. A zero forcing set of a graph is an initial set of coloured vertices that can eventually force the entire graph to be coloured. The zero forcing number is the size of the smallest zero forcing set. We explore the zero forcing number for random regular graphs, improving on bounds given by Kalinowski, Kam˘cev and Sudakov [15]. We also propose and analyze a degree greedy algorithm for finding small zero forcing sets using the differential equations method.
DOI
10.4310/JOC.2021.v12.n1.a4
MSU Digital Commons Citation
Bal, Deepak; Bennett, Patrick; English, Sean; Macrury, Calum; and Pra̷lat, Pawe̷l, "Zero-forcing in random regular graphs" (2021). Department of Mathematics Faculty Scholarship and Creative Works. 259.
https://digitalcommons.montclair.edu/mathsci-facpubs/259
Rights
This article is Open Access via the publisher.
Published Citation
Bal, D., Bennett, P., English, S., MacRury, C., & Prałat, P. (2021). Zero-forcing in random regular graphs. J. Comb, 12(1), 85-116.