The Zero Forcing Number of Graphs

Title
The Zero Forcing Number of Graphs
Publication Date
2019
Author(s)
Kalinowski, Thomas
( author )
OrcID: https://orcid.org/0000-0002-8444-6848
Email: tkalinow@une.edu.au
UNE Id une-id:tkalinow
Kamcev, Nina
Sudakov, Benny
Type of document
Journal Article
Language
en
Entity Type
Publication
Publisher
Society for Industrial and Applied Mathematics
Place of publication
United States of America
DOI
10.1137/17M1133051
UNE publication id
une:1959.11/26626
Abstract
A subset S of initially infected vertices of a graph G is called zero forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbor, infects this neighbor. The zero forcing number of G is the minimum cardinality of a zero forcing set in G. We study the zero forcing number of various classes of graphs, including graphs of large girth, H-free graphs for a fixed bipartite graph H, and random and pseudorandom graphs.
Link
Citation
SIAM Journal on Discrete Mathematics, 33(1), p. 95-115
ISSN
1095-7146
0895-4801
Start page
95
End page
115

Files:

NameSizeformatDescriptionLink