Download this article
 Download this article For screen
For printing
Recent Issues

Volume 17
Issue 2, 183–362
Issue 1, 1–182

Volume 16, 5 issues

Volume 15, 5 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 8 issues

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN (electronic): 1944-4184
ISSN (print): 1944-4176
 
Author index
To appear
 
Other MSP journals
A lower bound on the failed zero-forcing number of a graph

Nicolas Swanson and Eric Ufferman

Vol. 16 (2023), No. 3, 493–504
Abstract

Given a finite simple graph G = (V,E) and a set of vertices marked as filled, we consider a color-change rule known as zero forcing. A set S is a zero-forcing set if filling S and applying all possible instances of the color-change rule causes all vertices in V to be filled. A failed zero-forcing set is a set of vertices that is not a zero-forcing set. Given a graph G, the failed zero-forcing number F(G) is the maximum order of a failed zero-forcing set. Fetcie, Jacob and Saavedra (Involve 8:1 (2015), 99–117) asked whether given any k there exists an such that all graphs with at least vertices must satisfy F(G) k. We answer this question affirmatively by proving that for a graph G with n vertices, F(G) (n 1)2.

Keywords
failed zero forcing
Mathematical Subject Classification
Primary: 05C99
Milestones
Received: 14 April 2022
Revised: 2 August 2022
Accepted: 5 August 2022
Published: 10 August 2023

Communicated by Kenneth S. Berenhaut
Authors
Nicolas Swanson
Department of Mathematics
Virginia Tech University
Blacksburg, VA
United States
Eric Ufferman
Department of Mathematics
Virginia Tech University
Blacksburg, VA
United States