Minimum rank and failed zero forcing number of graphs

preprint2022arXivOpen access

Abstract

Let GG be a simple, finite, and undirected graph with vertices each given an initial coloring of either blue or white. Zero forcing on graph GG is an iterative process of forcing its white vertices to become blue after a finite application of a specified color-change rule. We say that an initial set SS of blue vertices of GG is a zero forcing set for GG under the specified color-change rule if a finite number of iterations of zero forcing results to an updated coloring where all vertices of GG are blue. Otherwise, we say that SS is a failed zero forcing set for GG under the specified color-change rule. It is not difficult to see that any subset of a failed zero forcing set is also failed. Hence, our interest lies on the maximum possible cardinality of a failed zero forcing set, which we refer to as the failed zero forcing number of GG. In this paper, we consider two color-change rules −- standard and positive semidefinite. We compute for the failed zero forcing numbers of several graph families. Furthermore, under each graph family, we characterize the graphs GG for which the failed zero forcing number is equal to the minimum rank of GG.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.