Zero Forcing Number of Random Regular Graphs
Combinatorics
2018-12-18 v1
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\u{c}ev and Sudakov. We also propose and analyze a degree-greedy algorithm for finding small zero forcing sets using the differential equations method.
Cite
@article{arxiv.1812.06477,
title = {Zero Forcing Number of Random Regular Graphs},
author = {Deepak Bal and Patrick Bennett and Sean English and Calum MacRury and Paweł Prałat},
journal= {arXiv preprint arXiv:1812.06477},
year = {2018}
}