Maximal failed zero forcing sets for products of two graphs

preprint2022arXivOpen access

Abstract

Let GG be a simple, finite graph with vertex set V(G)V(G) and edge set E(G)E(G), where each vertex is either colored blue or white. Define the standard zero forcing process on GG with the following color-change rule: let SS be the set of all initially blue vertices of GG and let u∈Su \in S. If vv is the unique white vertex adjacent to uu in GG, color vv blue and update SS by adding vv to SS. If S=V(G)S = V(G) after a finite number of iterations of the color-change rule, we say that SS is a zero forcing set for GG. Otherwise, we say that SS is a failed zero forcing set. In this paper, we construct maximal failed zero forcing sets for graph products such as Cartesian products, strong products, lexicographic products, and coronas. In particular, we consider products of two paths, two cycles, and two complete graphs.

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.