Given a graph
, the
zero forcing number of
,
, is the smallest
cardinality of any set
of vertices on which repeated applications of the color change rule results in all vertices joining
. The
color changerule is: if a vertex
is in
, and exactly
one neighbor
of
is not
in
,
then
joins
in the next iteration.
In this paper, we introduce a new graph parameter, the failed
zero forcing number of a graph. The
failed zero forcing number of
,
, is
the maximum cardinality of any set of vertices on which repeated applications of the
color change rule will never result in all vertices joining the set.
We establish bounds on the failed zero forcing number of a graph, both in general
and for connected graphs. We also classify connected graphs that achieve the upper
bound, graphs whose failed zero forcing numbers are zero or one, and unusual graphs
with smaller failed zero forcing number than zero forcing number. We determine
formulas for the failed zero forcing numbers of several families of graphs and provide
a lower bound on the failed zero forcing number of the Cartesian product of two
graphs.
We conclude by presenting open questions about the failed zero forcing number
and zero forcing in general.
Keywords
zero forcing number, vertex labeling, graph coloring
Department of Civil Engineering
Technology, Environmental Management and Safety
Rochester Institute of Technology
1 Lomb Memorial Drive
Rochester, NY 14623
United States
Science and Mathematics Department,
National Technical Institute for the Deaf
Rochester Institute of Technology
52 Lomb Memorial Drive
Rochester, NY 14623
United States
Department of Packaging
Science
College of Applied Science and Technology
Rochester Institute of Technology
1 Lomb Memorial Drive
Rochester, NY 14623
United States